./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 30f4e4ab 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.24-30f4e4a [2019-11-27 23:53:08,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:53:08,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:53:08,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:53:08,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:53:08,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:53:08,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:53:08,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:53:08,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:53:08,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:53:08,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:53:08,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:53:08,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:53:08,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:53:08,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:53:08,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:53:08,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:53:08,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:53:08,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:53:08,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:53:08,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:53:08,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:53:08,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:53:08,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:53:08,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:53:08,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:53:08,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:53:08,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:53:08,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:53:08,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:53:08,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:53:08,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:53:08,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:53:08,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:53:08,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:53:08,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:53:08,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:53:08,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:53:08,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:53:08,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:53:08,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:53:08,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:53:08,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:53:08,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:53:08,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:53:08,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:53:08,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:53:08,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:53:08,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:53:08,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:53:08,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:53:08,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:53:08,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:53:08,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:53:08,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:53:08,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:53:08,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:53:08,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:53:08,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:53:08,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:53:08,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:53:08,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:53:08,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:53:08,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:08,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:53:08,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:53:08,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:53:08,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:53:08,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:53:08,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:53:08,128 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-27 23:53:08,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:53:08,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:53:08,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:53:08,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:53:08,440 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:53:08,442 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-27 23:53:08,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f534542c2/8b9ff9b01850410490221b2c1fd1e174/FLAG24160ae7d [2019-11-27 23:53:09,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:53:09,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2019-11-27 23:53:09,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f534542c2/8b9ff9b01850410490221b2c1fd1e174/FLAG24160ae7d [2019-11-27 23:53:09,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f534542c2/8b9ff9b01850410490221b2c1fd1e174 [2019-11-27 23:53:09,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:53:09,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:53:09,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:09,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:53:09,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:53:09,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:09,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a770ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09, skipping insertion in model container [2019-11-27 23:53:09,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:09,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:53:09,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:53:09,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:09,867 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:53:09,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:09,992 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:53:09,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09 WrapperNode [2019-11-27 23:53:09,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:09,994 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:09,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:53:09,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:53:10,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:10,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:53:10,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:53:10,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:10,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:53:10,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:53:10,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:53:10,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (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-27 23:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 23:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:53:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:53:10,566 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:53:10,567 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:53:10,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:10 BoogieIcfgContainer [2019-11-27 23:53:10,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:53:10,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:53:10,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:53:10,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:53:10,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:53:09" (1/3) ... [2019-11-27 23:53:10,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2a4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:10, skipping insertion in model container [2019-11-27 23:53:10,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09" (2/3) ... [2019-11-27 23:53:10,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec2a4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:10, skipping insertion in model container [2019-11-27 23:53:10,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:10" (3/3) ... [2019-11-27 23:53:10,578 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2019-11-27 23:53:10,588 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:53:10,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-27 23:53:10,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-27 23:53:10,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:53:10,637 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:53:10,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:53:10,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:53:10,638 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:53:10,638 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:53:10,638 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:53:10,638 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:53:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-27 23:53:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 23:53:10,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:10,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 23:53:10,663 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-27 23:53:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:10,669 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-27 23:53:10,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:10,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646362075] [2019-11-27 23:53:10,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:10,829 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-27 23:53:10,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646362075] [2019-11-27 23:53:10,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:10,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:10,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541690427] [2019-11-27 23:53:10,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:10,853 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-11-27 23:53:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:10,887 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-27 23:53:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:10,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-27 23:53:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:10,900 INFO L225 Difference]: With dead ends: 85 [2019-11-27 23:53:10,900 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:53:10,904 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-27 23:53:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:53:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-27 23:53:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 23:53:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-27 23:53:10,945 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 4 [2019-11-27 23:53:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:10,945 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-27 23:53:10,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-27 23:53:10,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:10,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:10,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:10,947 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-27 23:53:10,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-27 23:53:10,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:10,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886326689] [2019-11-27 23:53:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,060 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-27 23:53:11,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886326689] [2019-11-27 23:53:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:11,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094376022] [2019-11-27 23:53:11,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:11,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:11,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:11,068 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-11-27 23:53:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,178 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-11-27 23:53:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:11,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 23:53:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,181 INFO L225 Difference]: With dead ends: 64 [2019-11-27 23:53:11,181 INFO L226 Difference]: Without dead ends: 38 [2019-11-27 23:53:11,182 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-27 23:53:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-27 23:53:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-27 23:53:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 23:53:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-27 23:53:11,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2019-11-27 23:53:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,190 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-27 23:53:11,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-27 23:53:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:11,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,192 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-27 23:53:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,192 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-27 23:53:11,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003199170] [2019-11-27 23:53:11,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,352 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-27 23:53:11,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003199170] [2019-11-27 23:53:11,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:53:11,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995684815] [2019-11-27 23:53:11,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:53:11,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:53:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:11,356 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 7 states. [2019-11-27 23:53:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,644 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-27 23:53:11,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:53:11,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-27 23:53:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,647 INFO L225 Difference]: With dead ends: 54 [2019-11-27 23:53:11,648 INFO L226 Difference]: Without dead ends: 52 [2019-11-27 23:53:11,650 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-27 23:53:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-27 23:53:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-27 23:53:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-27 23:53:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-27 23:53:11,665 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2019-11-27 23:53:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,666 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-27 23:53:11,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:53:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-27 23:53:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:11,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,668 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-27 23:53:11,669 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-27 23:53:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-27 23:53:11,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017572647] [2019-11-27 23:53:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,806 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-27 23:53:11,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017572647] [2019-11-27 23:53:11,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:11,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692180603] [2019-11-27 23:53:11,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:11,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:11,810 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-11-27 23:53:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,862 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2019-11-27 23:53:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:11,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-27 23:53:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,864 INFO L225 Difference]: With dead ends: 63 [2019-11-27 23:53:11,864 INFO L226 Difference]: Without dead ends: 34 [2019-11-27 23:53:11,867 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-27 23:53:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-27 23:53:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-27 23:53:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-27 23:53:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-27 23:53:11,878 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2019-11-27 23:53:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,878 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-27 23:53:11,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-27 23:53:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:11,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,881 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-27 23:53:11,881 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-27 23:53:11,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-27 23:53:11,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638075984] [2019-11-27 23:53:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,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-27 23:53:12,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638075984] [2019-11-27 23:53:12,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 23:53:12,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984167309] [2019-11-27 23:53:12,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:53:12,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:53:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:53:12,093 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2019-11-27 23:53:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,515 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-27 23:53:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:12,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-27 23:53:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,518 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:53:12,518 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:53:12,522 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-27 23:53:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:53:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 23:53:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:53:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-27 23:53:12,539 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-27 23:53:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,540 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-27 23:53:12,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:53:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-27 23:53:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:12,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,542 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-27 23:53:12,543 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-27 23:53:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-27 23:53:12,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890893096] [2019-11-27 23:53:12,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,700 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-27 23:53:12,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890893096] [2019-11-27 23:53:12,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 23:53:12,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430656789] [2019-11-27 23:53:12,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:53:12,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:53:12,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:53:12,702 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2019-11-27 23:53:12,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,913 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-27 23:53:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:53:12,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 23:53:12,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,918 INFO L225 Difference]: With dead ends: 54 [2019-11-27 23:53:12,918 INFO L226 Difference]: Without dead ends: 46 [2019-11-27 23:53:12,919 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-27 23:53:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-27 23:53:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-11-27 23:53:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:53:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-11-27 23:53:12,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-11-27 23:53:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,931 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-11-27 23:53:12,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:53:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-11-27 23:53:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:12,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,933 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-27 23:53:12,933 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-27 23:53:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-27 23:53:12,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650155102] [2019-11-27 23:53:12,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:13,071 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-27 23:53:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650155102] [2019-11-27 23:53:13,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:13,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 23:53:13,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46140827] [2019-11-27 23:53:13,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:53:13,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:53:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:13,073 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2019-11-27 23:53:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:13,403 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-27 23:53:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:13,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-27 23:53:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:13,405 INFO L225 Difference]: With dead ends: 56 [2019-11-27 23:53:13,405 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 23:53:13,406 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-27 23:53:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 23:53:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-27 23:53:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:53:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-27 23:53:13,412 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-27 23:53:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:13,412 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-27 23:53:13,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:53:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-27 23:53:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:13,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:13,414 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-27 23:53:13,414 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-27 23:53:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:13,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-27 23:53:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352996655] [2019-11-27 23:53:13,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:13,585 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-27 23:53:13,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352996655] [2019-11-27 23:53:13,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:13,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 23:53:13,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909743248] [2019-11-27 23:53:13,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:53:13,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:53:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:53:13,588 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 14 states. [2019-11-27 23:53:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:14,101 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-11-27 23:53:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 23:53:14,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-27 23:53:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:14,103 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:53:14,103 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 23:53:14,104 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-27 23:53:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 23:53:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-27 23:53:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-27 23:53:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-27 23:53:14,110 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2019-11-27 23:53:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:14,110 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-27 23:53:14,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:53:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-27 23:53:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:14,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:14,111 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-27 23:53:14,112 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-27 23:53:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-27 23:53:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:14,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828528608] [2019-11-27 23:53:14,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:14,190 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-27 23:53:14,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828528608] [2019-11-27 23:53:14,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:14,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:14,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052903975] [2019-11-27 23:53:14,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:14,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:14,192 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-27 23:53:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:14,250 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-27 23:53:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:53:14,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-27 23:53:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:14,253 INFO L225 Difference]: With dead ends: 46 [2019-11-27 23:53:14,253 INFO L226 Difference]: Without dead ends: 42 [2019-11-27 23:53:14,254 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-27 23:53:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-27 23:53:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-27 23:53:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:53:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-27 23:53:14,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2019-11-27 23:53:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:14,259 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-27 23:53:14,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-27 23:53:14,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:14,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:14,261 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-27 23:53:14,261 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-27 23:53:14,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-27 23:53:14,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:14,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893473004] [2019-11-27 23:53:14,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:14,364 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-27 23:53:14,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893473004] [2019-11-27 23:53:14,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:14,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-27 23:53:14,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766969045] [2019-11-27 23:53:14,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 23:53:14,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 23:53:14,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:53:14,366 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-11-27 23:53:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:14,871 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-11-27 23:53:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 23:53:14,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-27 23:53:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:14,873 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:53:14,873 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 23:53:14,874 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-27 23:53:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 23:53:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2019-11-27 23:53:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-27 23:53:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-27 23:53:14,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2019-11-27 23:53:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:14,881 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-27 23:53:14,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 23:53:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-27 23:53:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:53:14,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:14,882 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-27 23:53:14,882 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-27 23:53:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 758876958, now seen corresponding path program 1 times [2019-11-27 23:53:14,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:14,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772475072] [2019-11-27 23:53:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:14,961 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-27 23:53:14,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772475072] [2019-11-27 23:53:14,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:14,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 23:53:14,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671798797] [2019-11-27 23:53:14,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:53:14,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:14,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:53:14,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:53:14,963 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2019-11-27 23:53:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:15,129 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-27 23:53:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:53:15,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-27 23:53:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:15,130 INFO L225 Difference]: With dead ends: 44 [2019-11-27 23:53:15,130 INFO L226 Difference]: Without dead ends: 34 [2019-11-27 23:53:15,131 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-27 23:53:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-27 23:53:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-27 23:53:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-27 23:53:15,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-11-27 23:53:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:15,135 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-27 23:53:15,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:53:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-27 23:53:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:53:15,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:15,136 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-27 23:53:15,136 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-27 23:53:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash -50469668, now seen corresponding path program 1 times [2019-11-27 23:53:15,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:15,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597587563] [2019-11-27 23:53:15,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:53:15,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:53:15,195 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:53:15,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:53:15 BoogieIcfgContainer [2019-11-27 23:53:15,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:53:15,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:53:15,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:53:15,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:53:15,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:10" (3/4) ... [2019-11-27 23:53:15,265 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:53:15,385 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:53:15,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:53:15,391 INFO L168 Benchmark]: Toolchain (without parser) took 6015.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 959.0 MB in the beginning and 950.8 MB in the end (delta: 8.2 MB). Peak memory consumption was 230.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,392 INFO L168 Benchmark]: CDTParser took 0.34 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-27 23:53:15,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.15 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-27 23:53:15,393 INFO L168 Benchmark]: Boogie Preprocessor took 28.79 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-27 23:53:15,394 INFO L168 Benchmark]: RCFGBuilder took 494.54 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,395 INFO L168 Benchmark]: TraceAbstraction took 4691.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 958.8 MB in the end (delta: 132.7 MB). Peak memory consumption was 206.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,395 INFO L168 Benchmark]: Witness Printer took 127.47 ms. Allocated memory is still 1.3 GB. Free memory was 958.8 MB in the beginning and 950.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,398 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.34 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 618.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.15 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 28.79 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 494.54 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4691.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 958.8 MB in the end (delta: 132.7 MB). Peak memory consumption was 206.1 MB. Max. memory is 11.5 GB. * Witness Printer took 127.47 ms. Allocated memory is still 1.3 GB. Free memory was 958.8 MB in the beginning and 950.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 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.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.7s, 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.1s 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.1s 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...