./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.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/forester-heap/sll-01-2.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 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:58:56,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:58:56,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:58:56,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:58:56,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:58:56,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:58:56,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:58:56,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:58:56,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:58:56,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:58:56,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:58:56,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:58:56,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:58:56,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:58:56,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:58:56,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:58:56,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:58:56,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:58:56,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:58:56,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:58:56,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:58:56,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:58:56,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:58:56,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:58:56,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:58:56,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:58:56,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:58:56,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:58:56,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:58:56,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:58:56,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:58:56,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:58:56,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:58:56,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:58:56,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:58:56,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:58:56,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:58:56,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:58:56,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:58:56,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:58:56,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:58:56,287 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:58:56,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:58:56,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:58:56,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:58:56,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:58:56,303 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:58:56,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:58:56,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:58:56,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:58:56,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:58:56,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:58:56,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:58:56,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:58:56,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:58:56,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:58:56,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:58:56,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:58:56,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:58:56,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:58:56,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:58:56,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:58:56,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:58:56,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:58:56,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:58:56,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:58:56,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:58:56,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:58:56,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:58:56,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:58:56,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:58:56,308 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 -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2019-11-28 16:58:56,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:58:56,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:58:56,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:58:56,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:58:56,641 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:58:56,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-28 16:58:56,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e17e6ce3/deed611489d94241abd41b4705a9bca2/FLAG87ce1fd18 [2019-11-28 16:58:57,278 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:58:57,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2019-11-28 16:58:57,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e17e6ce3/deed611489d94241abd41b4705a9bca2/FLAG87ce1fd18 [2019-11-28 16:58:57,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e17e6ce3/deed611489d94241abd41b4705a9bca2 [2019-11-28 16:58:57,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:58:57,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:58:57,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:58:57,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:58:57,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:58:57,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:58:57" (1/1) ... [2019-11-28 16:58:57,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3122eb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:57, skipping insertion in model container [2019-11-28 16:58:57,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:58:57" (1/1) ... [2019-11-28 16:58:57,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:58:57,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:58:58,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:58:58,032 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:58:58,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:58:58,159 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:58:58,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58 WrapperNode [2019-11-28 16:58:58,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:58:58,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:58:58,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:58:58,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:58:58,170 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:58:58" (1/1) ... [2019-11-28 16:58:58,204 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:58:58" (1/1) ... [2019-11-28 16:58:58,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:58:58,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:58:58,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:58:58,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:58:58,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (1/1) ... [2019-11-28 16:58:58,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:58:58,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:58:58,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:58:58,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:58:58,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (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:58:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:58:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:58:58,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:58:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:58:58,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:58:58,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:58:58,870 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:58:58,871 INFO L287 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-28 16:58:58,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:58 BoogieIcfgContainer [2019-11-28 16:58:58,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:58:58,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:58:58,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:58:58,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:58:58,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:58:57" (1/3) ... [2019-11-28 16:58:58,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6a5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:58:58, skipping insertion in model container [2019-11-28 16:58:58,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:58:58" (2/3) ... [2019-11-28 16:58:58,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c6a5a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:58:58, skipping insertion in model container [2019-11-28 16:58:58,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:58" (3/3) ... [2019-11-28 16:58:58,881 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-11-28 16:58:58,892 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:58:58,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-28 16:58:58,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-28 16:58:58,941 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:58:58,941 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:58:58,942 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:58:58,942 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:58:58,942 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:58:58,943 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:58:58,943 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:58:58,943 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:58:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-28 16:58:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 16:58:58,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:58,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 16:58:58,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2019-11-28 16:58:58,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:58,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773860560] [2019-11-28 16:58:58,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:59,141 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:58:59,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773860560] [2019-11-28 16:58:59,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:59,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:58:59,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977307990] [2019-11-28 16:58:59,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:58:59,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:58:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:58:59,164 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-28 16:58:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:59,244 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2019-11-28 16:58:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:58:59,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-28 16:58:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:59,262 INFO L225 Difference]: With dead ends: 182 [2019-11-28 16:58:59,262 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 16:58:59,272 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:58:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 16:58:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-11-28 16:58:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 16:58:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2019-11-28 16:58:59,313 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2019-11-28 16:58:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:59,314 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2019-11-28 16:58:59,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:58:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2019-11-28 16:58:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:58:59,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:59,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:59,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2019-11-28 16:58:59,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:59,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959825662] [2019-11-28 16:58:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:59,385 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:58:59,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959825662] [2019-11-28 16:58:59,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:59,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:58:59,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392057933] [2019-11-28 16:58:59,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:58:59,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:58:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:58:59,389 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 3 states. [2019-11-28 16:58:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:59,424 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2019-11-28 16:58:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:58:59,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 16:58:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:59,428 INFO L225 Difference]: With dead ends: 81 [2019-11-28 16:58:59,428 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 16:58:59,430 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:58:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 16:58:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-28 16:58:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 16:58:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-28 16:58:59,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2019-11-28 16:58:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:59,457 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-28 16:58:59,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:58:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-28 16:58:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:58:59,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:59,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:59,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:59,462 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2019-11-28 16:58:59,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:59,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456010988] [2019-11-28 16:58:59,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:59,589 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:58:59,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456010988] [2019-11-28 16:58:59,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:59,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:59,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126336964] [2019-11-28 16:58:59,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:59,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:59,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:59,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:59,594 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-11-28 16:58:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:59,698 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-11-28 16:58:59,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:58:59,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 16:58:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:59,699 INFO L225 Difference]: With dead ends: 80 [2019-11-28 16:58:59,700 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 16:58:59,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 16:58:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-28 16:58:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 16:58:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-28 16:58:59,709 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2019-11-28 16:58:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:59,709 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-28 16:58:59,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:58:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-28 16:58:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:58:59,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:59,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:59,711 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2019-11-28 16:58:59,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:59,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53707673] [2019-11-28 16:58:59,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:59,787 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:58:59,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53707673] [2019-11-28 16:58:59,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:59,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:58:59,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498536475] [2019-11-28 16:58:59,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:58:59,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:58:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:58:59,790 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 3 states. [2019-11-28 16:58:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:58:59,866 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-11-28 16:58:59,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:58:59,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 16:58:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:58:59,868 INFO L225 Difference]: With dead ends: 79 [2019-11-28 16:58:59,869 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 16:58:59,869 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:58:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 16:58:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-11-28 16:58:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 16:58:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2019-11-28 16:58:59,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2019-11-28 16:58:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:58:59,877 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2019-11-28 16:58:59,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:58:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2019-11-28 16:58:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:58:59,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:58:59,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:58:59,879 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:58:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:58:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2019-11-28 16:58:59,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:58:59,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150782811] [2019-11-28 16:58:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:58:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:58:59,951 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:58:59,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150782811] [2019-11-28 16:58:59,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:58:59,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:58:59,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860549311] [2019-11-28 16:58:59,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:58:59,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:58:59,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:58:59,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:58:59,957 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 4 states. [2019-11-28 16:59:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:00,136 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2019-11-28 16:59:00,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:59:00,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 16:59:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:00,141 INFO L225 Difference]: With dead ends: 190 [2019-11-28 16:59:00,141 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 16:59:00,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 16:59:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2019-11-28 16:59:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 16:59:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-11-28 16:59:00,160 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2019-11-28 16:59:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:00,164 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-11-28 16:59:00,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:59:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-11-28 16:59:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:59:00,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:00,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:59:00,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:00,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2019-11-28 16:59:00,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:00,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311021551] [2019-11-28 16:59:00,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:00,256 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:59:00,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311021551] [2019-11-28 16:59:00,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:00,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:00,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514018829] [2019-11-28 16:59:00,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:00,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:00,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:00,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:00,260 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 5 states. [2019-11-28 16:59:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:00,365 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-28 16:59:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:59:00,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 16:59:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:00,368 INFO L225 Difference]: With dead ends: 134 [2019-11-28 16:59:00,368 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 16:59:00,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:59:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 16:59:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2019-11-28 16:59:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 16:59:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2019-11-28 16:59:00,376 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2019-11-28 16:59:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:00,377 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2019-11-28 16:59:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2019-11-28 16:59:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 16:59:00,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:00,379 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] [2019-11-28 16:59:00,379 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:00,380 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2019-11-28 16:59:00,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:00,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136808182] [2019-11-28 16:59:00,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:00,419 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:59:00,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136808182] [2019-11-28 16:59:00,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:00,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:00,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380397204] [2019-11-28 16:59:00,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:00,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:00,425 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand 3 states. [2019-11-28 16:59:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:00,453 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2019-11-28 16:59:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:00,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 16:59:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:00,455 INFO L225 Difference]: With dead ends: 139 [2019-11-28 16:59:00,456 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 16:59:00,456 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:59:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 16:59:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2019-11-28 16:59:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 16:59:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-28 16:59:00,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2019-11-28 16:59:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:00,474 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-28 16:59:00,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-28 16:59:00,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:59:00,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:00,476 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] [2019-11-28 16:59:00,476 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2019-11-28 16:59:00,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:00,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64957275] [2019-11-28 16:59:00,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:00,544 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:59:00,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64957275] [2019-11-28 16:59:00,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:00,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:00,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402858165] [2019-11-28 16:59:00,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:00,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:00,546 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 3 states. [2019-11-28 16:59:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:00,568 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-11-28 16:59:00,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:00,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 16:59:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:00,569 INFO L225 Difference]: With dead ends: 76 [2019-11-28 16:59:00,569 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 16:59:00,570 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:59:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 16:59:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 16:59:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 16:59:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-28 16:59:00,576 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2019-11-28 16:59:00,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:00,577 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-28 16:59:00,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-28 16:59:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 16:59:00,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:00,579 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] [2019-11-28 16:59:00,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2019-11-28 16:59:00,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:00,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488089682] [2019-11-28 16:59:00,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:00,629 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:59:00,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488089682] [2019-11-28 16:59:00,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:00,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:59:00,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720975630] [2019-11-28 16:59:00,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:59:00,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:00,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:59:00,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:59:00,633 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-11-28 16:59:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:00,712 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-28 16:59:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:59:00,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-28 16:59:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:00,713 INFO L225 Difference]: With dead ends: 75 [2019-11-28 16:59:00,714 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 16:59:00,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:59:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 16:59:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-11-28 16:59:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 16:59:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-11-28 16:59:00,719 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2019-11-28 16:59:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-28 16:59:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:59:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-11-28 16:59:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:59:00,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:00,721 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] [2019-11-28 16:59:00,722 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:00,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2019-11-28 16:59:00,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:00,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776824916] [2019-11-28 16:59:00,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:00,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-28 16:59:00,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776824916] [2019-11-28 16:59:00,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:00,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:59:00,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361738350] [2019-11-28 16:59:00,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:59:00,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:59:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:59:00,809 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 6 states. [2019-11-28 16:59:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:01,047 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2019-11-28 16:59:01,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:59:01,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 16:59:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:01,049 INFO L225 Difference]: With dead ends: 178 [2019-11-28 16:59:01,049 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 16:59:01,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:59:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 16:59:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2019-11-28 16:59:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 16:59:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-28 16:59:01,056 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2019-11-28 16:59:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:01,056 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-28 16:59:01,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:59:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-28 16:59:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:59:01,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:01,058 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] [2019-11-28 16:59:01,058 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:01,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:01,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2019-11-28 16:59:01,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:01,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280459178] [2019-11-28 16:59:01,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:01,384 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:59:01,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280459178] [2019-11-28 16:59:01,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:01,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 16:59:01,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849073828] [2019-11-28 16:59:01,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:59:01,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:59:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:59:01,386 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 8 states. [2019-11-28 16:59:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:02,085 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2019-11-28 16:59:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 16:59:02,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 16:59:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:02,089 INFO L225 Difference]: With dead ends: 190 [2019-11-28 16:59:02,090 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 16:59:02,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-28 16:59:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 16:59:02,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 102. [2019-11-28 16:59:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 16:59:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2019-11-28 16:59:02,101 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2019-11-28 16:59:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:02,101 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2019-11-28 16:59:02,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:59:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2019-11-28 16:59:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:59:02,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:02,103 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] [2019-11-28 16:59:02,103 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2019-11-28 16:59:02,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:02,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411980634] [2019-11-28 16:59:02,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:02,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411980634] [2019-11-28 16:59:02,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:02,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 16:59:02,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124139542] [2019-11-28 16:59:02,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 16:59:02,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 16:59:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:59:02,165 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand 5 states. [2019-11-28 16:59:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:02,277 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-11-28 16:59:02,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:59:02,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 16:59:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:02,279 INFO L225 Difference]: With dead ends: 149 [2019-11-28 16:59:02,279 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 16:59:02,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:59:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 16:59:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-28 16:59:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 16:59:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2019-11-28 16:59:02,289 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 26 [2019-11-28 16:59:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:02,289 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2019-11-28 16:59:02,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 16:59:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2019-11-28 16:59:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:59:02,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:02,291 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] [2019-11-28 16:59:02,291 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2019-11-28 16:59:02,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:02,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554586603] [2019-11-28 16:59:02,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 16:59:02,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554586603] [2019-11-28 16:59:02,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:02,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:02,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450662000] [2019-11-28 16:59:02,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:02,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:02,339 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 3 states. [2019-11-28 16:59:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:02,389 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2019-11-28 16:59:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:02,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 16:59:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:02,391 INFO L225 Difference]: With dead ends: 123 [2019-11-28 16:59:02,391 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 16:59:02,392 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:59:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 16:59:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-28 16:59:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 16:59:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2019-11-28 16:59:02,402 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 26 [2019-11-28 16:59:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:02,402 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2019-11-28 16:59:02,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2019-11-28 16:59:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:59:02,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:02,409 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] [2019-11-28 16:59:02,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2019-11-28 16:59:02,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:02,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169957392] [2019-11-28 16:59:02,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:02,642 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:59:02,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169957392] [2019-11-28 16:59:02,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:02,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 16:59:02,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243150638] [2019-11-28 16:59:02,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:59:02,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:02,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:59:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:59:02,644 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand 8 states. [2019-11-28 16:59:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:03,173 INFO L93 Difference]: Finished difference Result 285 states and 334 transitions. [2019-11-28 16:59:03,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:59:03,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-28 16:59:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:03,177 INFO L225 Difference]: With dead ends: 285 [2019-11-28 16:59:03,178 INFO L226 Difference]: Without dead ends: 283 [2019-11-28 16:59:03,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:59:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-28 16:59:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 128. [2019-11-28 16:59:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 16:59:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2019-11-28 16:59:03,190 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2019-11-28 16:59:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:03,190 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2019-11-28 16:59:03,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:59:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2019-11-28 16:59:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:03,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:03,192 INFO L410 BasicCegarLoop]: trace histogram [2, 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:59:03,193 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:03,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:03,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2019-11-28 16:59:03,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:03,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335277950] [2019-11-28 16:59:03,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:03,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335277950] [2019-11-28 16:59:03,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375274270] [2019-11-28 16:59:03,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:03,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 16:59:03,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:03,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 16:59:03,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 16:59:03,428 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,459 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-28 16:59:03,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:03,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-28 16:59:03,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,501 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:03,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-28 16:59:03,506 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-11-28 16:59:03,576 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 16:59:03,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 16:59:03,590 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:03,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:03,625 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-11-28 16:59:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:03,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:03,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2019-11-28 16:59:03,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587476515] [2019-11-28 16:59:03,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:59:03,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:59:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:59:03,631 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand 8 states. [2019-11-28 16:59:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:04,014 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2019-11-28 16:59:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 16:59:04,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-28 16:59:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:04,016 INFO L225 Difference]: With dead ends: 232 [2019-11-28 16:59:04,016 INFO L226 Difference]: Without dead ends: 170 [2019-11-28 16:59:04,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:59:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-28 16:59:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2019-11-28 16:59:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 16:59:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2019-11-28 16:59:04,039 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 29 [2019-11-28 16:59:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:04,040 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2019-11-28 16:59:04,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:59:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2019-11-28 16:59:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:59:04,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:04,042 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:59:04,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:04,249 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2019-11-28 16:59:04,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:04,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130000470] [2019-11-28 16:59:04,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130000470] [2019-11-28 16:59:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811282108] [2019-11-28 16:59:04,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:04,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:59:04,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:04,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:04,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-28 16:59:04,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:04,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-28 16:59:04,606 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:04,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:04,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-28 16:59:04,621 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:04,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-28 16:59:04,625 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:04,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:04,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-28 16:59:04,630 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:9 [2019-11-28 16:59:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:04,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:59:04,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-11-28 16:59:04,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623176290] [2019-11-28 16:59:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 16:59:04,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 16:59:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 16:59:04,649 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand 7 states. [2019-11-28 16:59:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:05,066 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2019-11-28 16:59:05,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:59:05,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-28 16:59:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:05,069 INFO L225 Difference]: With dead ends: 193 [2019-11-28 16:59:05,069 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 16:59:05,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:59:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 16:59:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2019-11-28 16:59:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 16:59:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-28 16:59:05,081 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 29 [2019-11-28 16:59:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:05,081 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-28 16:59:05,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 16:59:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-28 16:59:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 16:59:05,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:05,082 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-11-28 16:59:05,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:05,287 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2019-11-28 16:59:05,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:05,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209111125] [2019-11-28 16:59:05,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:05,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209111125] [2019-11-28 16:59:05,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355858738] [2019-11-28 16:59:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:05,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:59:05,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:05,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:59:05,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:05,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:05,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:05,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-28 16:59:05,582 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-28 16:59:05,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 16:59:05,586 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:05,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:05,607 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 16:59:05,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 16:59:05,608 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:05,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:05,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:05,612 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2019-11-28 16:59:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-11-28 16:59:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871806459] [2019-11-28 16:59:05,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:59:05,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:05,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:59:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:59:05,618 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2019-11-28 16:59:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:05,978 INFO L93 Difference]: Finished difference Result 233 states and 265 transitions. [2019-11-28 16:59:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:59:05,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-28 16:59:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:05,980 INFO L225 Difference]: With dead ends: 233 [2019-11-28 16:59:05,980 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 16:59:05,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 16:59:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 16:59:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2019-11-28 16:59:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 16:59:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2019-11-28 16:59:05,989 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2019-11-28 16:59:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:05,990 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2019-11-28 16:59:05,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:59:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2019-11-28 16:59:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 16:59:05,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:05,991 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, 1, 1, 1] [2019-11-28 16:59:06,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:06,203 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2019-11-28 16:59:06,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:06,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308464071] [2019-11-28 16:59:06,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:06,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308464071] [2019-11-28 16:59:06,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:59:06,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:59:06,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063063666] [2019-11-28 16:59:06,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:59:06,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:59:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:59:06,240 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 3 states. [2019-11-28 16:59:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:06,262 INFO L93 Difference]: Finished difference Result 308 states and 380 transitions. [2019-11-28 16:59:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:59:06,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 16:59:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:06,264 INFO L225 Difference]: With dead ends: 308 [2019-11-28 16:59:06,264 INFO L226 Difference]: Without dead ends: 214 [2019-11-28 16:59:06,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:59:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-28 16:59:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 171. [2019-11-28 16:59:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-28 16:59:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2019-11-28 16:59:06,274 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2019-11-28 16:59:06,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:06,275 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2019-11-28 16:59:06,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:59:06,275 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2019-11-28 16:59:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 16:59:06,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:06,275 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2019-11-28 16:59:06,276 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2019-11-28 16:59:06,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:06,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620204657] [2019-11-28 16:59:06,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:06,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620204657] [2019-11-28 16:59:06,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326933957] [2019-11-28 16:59:06,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:59:06,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 16:59:06,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:59:06,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 16:59:06,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 16:59:06,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:59:06,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:59:06,588 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,598 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-28 16:59:06,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:59:06,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:06,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-28 16:59:06,695 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:06,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2019-11-28 16:59:06,722 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,741 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:47 [2019-11-28 16:59:06,782 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_36|]} [2019-11-28 16:59:06,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:06,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-11-28 16:59:06,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:06,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:06,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:06,915 INFO L343 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2019-11-28 16:59:06,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2019-11-28 16:59:06,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:06,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:06,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:59:06,921 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-28 16:59:07,000 INFO L614 ElimStorePlain]: treesize reduction 273, result has 22.2 percent of original size [2019-11-28 16:59:07,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:59:07,002 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2019-11-28 16:59:07,119 INFO L430 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-28 16:59:07,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:59:07,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2019-11-28 16:59:07,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:07,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:07,194 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-28 16:59:07,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2019-11-28 16:59:07,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:07,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:07,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:07,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:59:07,198 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:59:07,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:59:07,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:59:07,204 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:7 [2019-11-28 16:59:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:59:07,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:59:07,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-28 16:59:07,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581428839] [2019-11-28 16:59:07,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 16:59:07,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:59:07,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 16:59:07,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-28 16:59:07,221 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand 13 states. [2019-11-28 16:59:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:59:08,339 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2019-11-28 16:59:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 16:59:08,339 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-11-28 16:59:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:59:08,341 INFO L225 Difference]: With dead ends: 479 [2019-11-28 16:59:08,341 INFO L226 Difference]: Without dead ends: 387 [2019-11-28 16:59:08,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-11-28 16:59:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-28 16:59:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2019-11-28 16:59:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-28 16:59:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2019-11-28 16:59:08,356 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2019-11-28 16:59:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:59:08,357 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2019-11-28 16:59:08,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 16:59:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2019-11-28 16:59:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 16:59:08,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:59:08,358 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:59:08,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:59:08,564 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:59:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:59:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2019-11-28 16:59:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:59:08,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719095397] [2019-11-28 16:59:08,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:59:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:59:08,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:59:08,618 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:59:08,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:59:08 BoogieIcfgContainer [2019-11-28 16:59:08,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:59:08,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:59:08,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:59:08,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:59:08,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:58:58" (3/4) ... [2019-11-28 16:59:08,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:59:08,762 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:59:08,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:59:08,764 INFO L168 Benchmark]: Toolchain (without parser) took 11198.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 956.3 MB in the beginning and 910.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 344.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:08,765 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:08,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:08,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.33 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:08,766 INFO L168 Benchmark]: Boogie Preprocessor took 38.02 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:59:08,767 INFO L168 Benchmark]: RCFGBuilder took 597.89 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:08,767 INFO L168 Benchmark]: TraceAbstraction took 9812.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 910.2 MB in the end (delta: 165.3 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:59:08,768 INFO L168 Benchmark]: Witness Printer took 75.69 ms. Allocated memory is still 1.3 GB. Free memory is still 910.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:59:08,781 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.33 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: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.02 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 597.89 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9812.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 910.2 MB in the end (delta: 165.3 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. * Witness Printer took 75.69 ms. Allocated memory is still 1.3 GB. Free memory is still 910.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) [L993] COND FALSE !(!(list != ((void*)0))) [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list [L1012] COND FALSE !(!(((void*)0) != end)) [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner [L1020] COND TRUE len == 0 [L1021] len = 1 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner [L1020] COND FALSE !(len == 0) [L1023] len = 2 [L1024] COND FALSE !(!(((void*)0) != inner)) [L1025] EXPR inner->inner [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Result: UNSAFE, OverallTime: 9.6s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1413 SDtfs, 2534 SDslu, 2750 SDs, 0 SdLazy, 1602 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 805 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 523 ConstructedInterpolants, 10 QuantifiedInterpolants, 187056 SizeOfPredicates, 41 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 8/19 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...