./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f18f7f1f917468e24f0e5d26966f1156107884dd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 16:57:21,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:57:21,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:57:21,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:57:21,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:57:21,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:57:21,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:57:21,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:57:21,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:57:21,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:57:21,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:57:21,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:57:21,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:57:21,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:57:21,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:57:21,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:57:21,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:57:21,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:57:21,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:57:21,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:57:21,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:57:21,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:57:21,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:57:21,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:57:21,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:57:21,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:57:21,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:57:21,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:57:21,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:57:21,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:57:21,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:57:21,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:57:21,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:57:21,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:57:21,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:57:21,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:57:21,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:57:21,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:57:21,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:57:21,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:57:21,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:57:21,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:57:21,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:57:21,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:57:21,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:57:21,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:57:21,130 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:57:21,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:57:21,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:57:21,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:57:21,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:57:21,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:57:21,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:57:21,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:57:21,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:57:21,132 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:57:21,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:57:21,132 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:57:21,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:57:21,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:57:21,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:57:21,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:57:21,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:57:21,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:57:21,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:57:21,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:57:21,134 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:57:21,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:57:21,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:57:21,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:57:21,135 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:57:21,135 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f18f7f1f917468e24f0e5d26966f1156107884dd [2019-11-28 16:57:21,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:57:21,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:57:21,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:57:21,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:57:21,483 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:57:21,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-28 16:57:21,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baba1be0e/2af9197c62d1422eb07f96993e0a4f41/FLAG95ea2b840 [2019-11-28 16:57:22,029 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:57:22,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-28 16:57:22,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baba1be0e/2af9197c62d1422eb07f96993e0a4f41/FLAG95ea2b840 [2019-11-28 16:57:22,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baba1be0e/2af9197c62d1422eb07f96993e0a4f41 [2019-11-28 16:57:22,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:57:22,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:57:22,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:22,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:57:22,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:57:22,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:22" (1/1) ... [2019-11-28 16:57:22,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b27421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:22, skipping insertion in model container [2019-11-28 16:57:22,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:57:22" (1/1) ... [2019-11-28 16:57:22,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:57:22,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:57:22,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:22,973 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:57:23,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:57:23,127 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:57:23,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23 WrapperNode [2019-11-28 16:57:23,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:57:23,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:23,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:57:23,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:57:23,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:57:23,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:57:23,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:57:23,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:57:23,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... [2019-11-28 16:57:23,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:57:23,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:57:23,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:57:23,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:57:23,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 16:57:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:57:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 16:57:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:57:23,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:57:23,711 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:57:23,711 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:57:23,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:23 BoogieIcfgContainer [2019-11-28 16:57:23,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:57:23,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:57:23,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:57:23,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:57:23,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:57:22" (1/3) ... [2019-11-28 16:57:23,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d69e16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:23, skipping insertion in model container [2019-11-28 16:57:23,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:57:23" (2/3) ... [2019-11-28 16:57:23,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d69e16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:57:23, skipping insertion in model container [2019-11-28 16:57:23,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:23" (3/3) ... [2019-11-28 16:57:23,720 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2019-11-28 16:57:23,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:57:23,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 16:57:23,755 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 16:57:23,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:57:23,782 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:57:23,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:57:23,783 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:57:23,783 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:57:23,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:57:23,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:57:23,784 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:57:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-28 16:57:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 16:57:23,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:23,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 16:57:23,808 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-28 16:57:23,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:23,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142282600] [2019-11-28 16:57:23,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:23,978 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-28 16:57:23,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142282600] [2019-11-28 16:57:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:23,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:57:23,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605868475] [2019-11-28 16:57:23,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:57:23,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:24,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:57:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:57:24,005 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-11-28 16:57:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:24,041 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-28 16:57:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:57:24,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-28 16:57:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:24,054 INFO L225 Difference]: With dead ends: 85 [2019-11-28 16:57:24,054 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 16:57:24,058 INFO L630 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-28 16:57:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 16:57:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 16:57:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 16:57:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-28 16:57:24,098 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-11-28 16:57:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:24,098 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-28 16:57:24,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:57:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-28 16:57:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:57:24,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:24,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:24,100 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-28 16:57:24,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:24,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412372938] [2019-11-28 16:57:24,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:24,225 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-28 16:57:24,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412372938] [2019-11-28 16:57:24,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:57:24,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320009767] [2019-11-28 16:57:24,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:57:24,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:57:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:57:24,229 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-11-28 16:57:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:24,331 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-28 16:57:24,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:57:24,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 16:57:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:24,333 INFO L225 Difference]: With dead ends: 64 [2019-11-28 16:57:24,333 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 16:57:24,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-28 16:57:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 16:57:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-28 16:57:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 16:57:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-28 16:57:24,345 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-11-28 16:57:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:24,346 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-28 16:57:24,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:57:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-28 16:57:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:57:24,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:24,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:24,348 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:24,349 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-28 16:57:24,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:24,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825916462] [2019-11-28 16:57:24,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:24,521 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-28 16:57:24,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825916462] [2019-11-28 16:57:24,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:24,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:57:24,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959903978] [2019-11-28 16:57:24,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 16:57:24,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 16:57:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:57:24,525 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-11-28 16:57:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:24,814 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-28 16:57:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:57:24,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 16:57:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:24,817 INFO L225 Difference]: With dead ends: 54 [2019-11-28 16:57:24,817 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 16:57:24,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:57:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 16:57:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-28 16:57:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 16:57:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-28 16:57:24,826 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-11-28 16:57:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:24,826 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-28 16:57:24,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 16:57:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-28 16:57:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:57:24,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:24,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:24,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:24,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-28 16:57:24,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:24,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311457750] [2019-11-28 16:57:24,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:24,938 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-28 16:57:24,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311457750] [2019-11-28 16:57:24,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:24,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:57:24,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457344968] [2019-11-28 16:57:24,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:57:24,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:57:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:57:24,943 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-11-28 16:57:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:25,005 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-28 16:57:25,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:57:25,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 16:57:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:25,007 INFO L225 Difference]: With dead ends: 63 [2019-11-28 16:57:25,007 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 16:57:25,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:57:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 16:57:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 16:57:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 16:57:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-28 16:57:25,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-11-28 16:57:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:25,025 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-28 16:57:25,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:57:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-28 16:57:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:57:25,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:25,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:25,027 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-28 16:57:25,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:25,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341887834] [2019-11-28 16:57:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:25,274 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-28 16:57:25,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341887834] [2019-11-28 16:57:25,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:25,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 16:57:25,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084914382] [2019-11-28 16:57:25,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 16:57:25,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:25,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 16:57:25,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:57:25,279 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-11-28 16:57:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:25,702 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-28 16:57:25,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:57:25,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-28 16:57:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:25,705 INFO L225 Difference]: With dead ends: 50 [2019-11-28 16:57:25,706 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 16:57:25,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 16:57:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 16:57:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 16:57:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 16:57:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 16:57:25,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-28 16:57:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:25,727 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 16:57:25,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 16:57:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 16:57:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:57:25,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:25,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:57:25,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-28 16:57:25,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:25,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984988790] [2019-11-28 16:57:25,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:25,916 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-28 16:57:25,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984988790] [2019-11-28 16:57:25,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:25,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 16:57:25,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572069519] [2019-11-28 16:57:25,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:57:25,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:57:25,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:57:25,919 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-11-28 16:57:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:26,122 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-28 16:57:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:57:26,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 16:57:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:26,126 INFO L225 Difference]: With dead ends: 54 [2019-11-28 16:57:26,126 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 16:57:26,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:57:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 16:57:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-28 16:57:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 16:57:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-28 16:57:26,135 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-11-28 16:57:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:26,136 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-28 16:57:26,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:57:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-28 16:57:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:57:26,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:26,138 INFO L410 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] [2019-11-28 16:57:26,138 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-28 16:57:26,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587954620] [2019-11-28 16:57:26,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:26,277 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-28 16:57:26,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587954620] [2019-11-28 16:57:26,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:26,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 16:57:26,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771585798] [2019-11-28 16:57:26,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:57:26,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:57:26,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:57:26,280 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-11-28 16:57:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:26,600 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-28 16:57:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:57:26,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-28 16:57:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:26,601 INFO L225 Difference]: With dead ends: 56 [2019-11-28 16:57:26,601 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 16:57:26,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:57:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 16:57:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-28 16:57:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 16:57:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 16:57:26,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-28 16:57:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:26,608 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 16:57:26,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:57:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 16:57:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:57:26,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:26,609 INFO L410 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] [2019-11-28 16:57:26,610 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-28 16:57:26,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:26,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142597405] [2019-11-28 16:57:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:26,772 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-28 16:57:26,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142597405] [2019-11-28 16:57:26,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:26,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-28 16:57:26,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780975226] [2019-11-28 16:57:26,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:57:26,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:26,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:57:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:57:26,775 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-11-28 16:57:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:27,292 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-28 16:57:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 16:57:27,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-28 16:57:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:27,294 INFO L225 Difference]: With dead ends: 55 [2019-11-28 16:57:27,294 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 16:57:27,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2019-11-28 16:57:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 16:57:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-28 16:57:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 16:57:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-28 16:57:27,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-11-28 16:57:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:27,301 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-28 16:57:27,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:57:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-28 16:57:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:57:27,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:27,302 INFO L410 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] [2019-11-28 16:57:27,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-28 16:57:27,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:27,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93841184] [2019-11-28 16:57:27,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:27,366 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-28 16:57:27,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93841184] [2019-11-28 16:57:27,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:27,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:57:27,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968305726] [2019-11-28 16:57:27,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:57:27,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:57:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:57:27,368 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-28 16:57:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:27,446 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-28 16:57:27,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:57:27,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 16:57:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:27,450 INFO L225 Difference]: With dead ends: 46 [2019-11-28 16:57:27,450 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 16:57:27,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:57:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 16:57:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 16:57:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 16:57:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 16:57:27,457 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-28 16:57:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:27,457 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 16:57:27,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:57:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 16:57:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:57:27,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:27,459 INFO L410 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] [2019-11-28 16:57:27,459 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-28 16:57:27,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:27,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814985082] [2019-11-28 16:57:27,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:27,573 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-28 16:57:27,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814985082] [2019-11-28 16:57:27,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:27,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 16:57:27,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102135353] [2019-11-28 16:57:27,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 16:57:27,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 16:57:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-28 16:57:27,575 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-11-28 16:57:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:28,157 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-28 16:57:28,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 16:57:28,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-28 16:57:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:28,158 INFO L225 Difference]: With dead ends: 50 [2019-11-28 16:57:28,159 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 16:57:28,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2019-11-28 16:57:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 16:57:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-11-28 16:57:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 16:57:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-28 16:57:28,167 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-11-28 16:57:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:28,167 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 16:57:28,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 16:57:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-28 16:57:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:57:28,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:28,169 INFO L410 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, 1, 1] [2019-11-28 16:57:28,169 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-11-28 16:57:28,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:28,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919162989] [2019-11-28 16:57:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:57:28,245 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-28 16:57:28,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919162989] [2019-11-28 16:57:28,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:57:28,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 16:57:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573656974] [2019-11-28 16:57:28,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:57:28,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:57:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:57:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:57:28,247 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-11-28 16:57:28,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:57:28,418 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-28 16:57:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:57:28,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-28 16:57:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:57:28,419 INFO L225 Difference]: With dead ends: 44 [2019-11-28 16:57:28,420 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 16:57:28,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-28 16:57:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 16:57:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-28 16:57:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:57:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-28 16:57:28,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-11-28 16:57:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:57:28,425 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-28 16:57:28,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:57:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-28 16:57:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:57:28,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:57:28,427 INFO L410 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, 1, 1] [2019-11-28 16:57:28,427 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:57:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:57:28,428 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-11-28 16:57:28,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:57:28,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130980828] [2019-11-28 16:57:28,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:57:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:57:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:57:28,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:57:28,483 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:57:28,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:57:28 BoogieIcfgContainer [2019-11-28 16:57:28,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:57:28,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:57:28,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:57:28,547 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:57:28,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:57:23" (3/4) ... [2019-11-28 16:57:28,550 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:57:28,640 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:57:28,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:57:28,643 INFO L168 Benchmark]: Toolchain (without parser) took 6253.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 957.7 MB in the beginning and 928.9 MB in the end (delta: 28.7 MB). Peak memory consumption was 234.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:28,644 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:57:28,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:28,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.69 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-28 16:57:28,646 INFO L168 Benchmark]: Boogie Preprocessor took 43.22 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-28 16:57:28,646 INFO L168 Benchmark]: RCFGBuilder took 450.05 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:28,647 INFO L168 Benchmark]: TraceAbstraction took 4832.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 937.0 MB in the end (delta: 132.2 MB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:28,648 INFO L168 Benchmark]: Witness Printer took 94.19 ms. Allocated memory is still 1.2 GB. Free memory was 937.0 MB in the beginning and 928.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:57:28,651 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.69 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 43.22 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 450.05 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4832.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 937.0 MB in the end (delta: 132.2 MB). Peak memory consumption was 210.9 MB. Max. memory is 11.5 GB. * Witness Printer took 94.19 ms. Allocated memory is still 1.2 GB. Free memory was 937.0 MB in the beginning and 928.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L867] void * guard_malloc_counter = 0; [L887] struct list_head *elem = ((void *)0); [L900] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L903] struct list_head *dev1, *dev2; [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L879] return __getMemory(size); [L904] dev1 = my_malloc(sizeof(*dev1)) [L871] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L872] guard_malloc_counter++ [L873] COND FALSE !(!__VERIFIER_nondet_int()) [L875] return (void *) guard_malloc_counter; VAL [elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L879] return __getMemory(size); [L905] dev2 = my_malloc(sizeof(*dev2)) [L906] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND TRUE __VERIFIER_nondet_int() [L892] elem = new VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L896] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L891] COND FALSE !(__VERIFIER_nondet_int()) [L890] (new!=elem) ? (0) : __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L6] __VERIFIER_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 6 error locations. Result: UNSAFE, OverallTime: 4.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 316 SDtfs, 1037 SDslu, 725 SDs, 0 SdLazy, 1052 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, 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, 11 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 19201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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...