java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:17:58,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:17:58,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:17:58,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:17:58,353 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:17:58,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:17:58,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:17:58,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:17:58,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:17:58,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:17:58,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:17:58,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:17:58,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:17:58,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:17:58,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:17:58,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:17:58,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:17:58,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:17:58,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:17:58,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:17:58,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:17:58,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:17:58,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:17:58,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:17:58,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:17:58,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:17:58,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:17:58,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:17:58,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:17:58,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:17:58,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:17:58,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:17:58,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:17:58,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:17:58,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:17:58,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:17:58,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:17:58,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:17:58,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:17:58,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:17:58,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:17:58,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:17:58,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:17:58,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:17:58,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:17:58,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:17:58,404 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:17:58,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:17:58,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:17:58,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:17:58,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:17:58,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:17:58,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:17:58,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:17:58,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:17:58,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:17:58,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:17:58,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:17:58,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:17:58,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:17:58,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:17:58,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:17:58,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:17:58,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:17:58,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:17:58,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:17:58,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:17:58,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:17:58,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:17:58,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:17:58,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:17:58,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:17:58,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:17:58,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:17:58,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:17:58,457 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:17:58,458 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2019-10-02 10:17:58,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c5b8c00/9d4f37e4975f444b85f34ab23f4e956d/FLAG6b6d8c5f2 [2019-10-02 10:17:59,010 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:17:59,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2019-10-02 10:17:59,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c5b8c00/9d4f37e4975f444b85f34ab23f4e956d/FLAG6b6d8c5f2 [2019-10-02 10:17:59,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c5b8c00/9d4f37e4975f444b85f34ab23f4e956d [2019-10-02 10:17:59,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:17:59,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:17:59,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:17:59,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:17:59,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:17:59,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45859c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59, skipping insertion in model container [2019-10-02 10:17:59,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,402 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:17:59,424 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:17:59,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:17:59,666 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:17:59,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:17:59,715 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:17:59,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59 WrapperNode [2019-10-02 10:17:59,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:17:59,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:17:59,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:17:59,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:17:59,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (1/1) ... [2019-10-02 10:17:59,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:17:59,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:17:59,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:17:59,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:17:59,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (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-10-02 10:17:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:17:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2019-10-02 10:17:59,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:17:59,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:17:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2019-10-02 10:17:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 10:17:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:17:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:17:59,916 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-10-02 10:17:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:17:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-10-02 10:17:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:17:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:17:59,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:17:59,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:18:00,301 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:18:00,301 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 10:18:00,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:18:00 BoogieIcfgContainer [2019-10-02 10:18:00,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:18:00,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:18:00,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:18:00,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:18:00,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:17:59" (1/3) ... [2019-10-02 10:18:00,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2675a1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:18:00, skipping insertion in model container [2019-10-02 10:18:00,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:17:59" (2/3) ... [2019-10-02 10:18:00,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2675a1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:18:00, skipping insertion in model container [2019-10-02 10:18:00,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:18:00" (3/3) ... [2019-10-02 10:18:00,311 INFO L109 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2019-10-02 10:18:00,320 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:18:00,326 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:18:00,342 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:18:00,371 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:18:00,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:18:00,372 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:18:00,372 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:18:00,373 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:18:00,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:18:00,373 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:18:00,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:18:00,373 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:18:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-10-02 10:18:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 10:18:00,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:00,399 INFO L411 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-10-02 10:18:00,401 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1451885248, now seen corresponding path program 1 times [2019-10-02 10:18:00,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:00,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:18:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:18:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:18:00,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:18:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:18:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:18:00,657 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-10-02 10:18:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:00,712 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2019-10-02 10:18:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:18:00,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 10:18:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:00,725 INFO L225 Difference]: With dead ends: 86 [2019-10-02 10:18:00,726 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 10:18:00,730 INFO L640 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-10-02 10:18:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 10:18:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-02 10:18:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 10:18:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-02 10:18:00,780 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 39 [2019-10-02 10:18:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:00,780 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-02 10:18:00,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:18:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-02 10:18:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 10:18:00,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:00,784 INFO L411 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2019-10-02 10:18:00,784 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:00,785 INFO L82 PathProgramCache]: Analyzing trace with hash -507187170, now seen corresponding path program 1 times [2019-10-02 10:18:00,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:00,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:00,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:00,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 10:18:00,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:00,912 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:01,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 10:18:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:18:01,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:18:01,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 10:18:01,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:18:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:18:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:18:01,062 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2019-10-02 10:18:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:01,111 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-10-02 10:18:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:18:01,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-02 10:18:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:01,122 INFO L225 Difference]: With dead ends: 67 [2019-10-02 10:18:01,122 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 10:18:01,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-10-02 10:18:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 10:18:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-02 10:18:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 10:18:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-10-02 10:18:01,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 41 [2019-10-02 10:18:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:01,142 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-10-02 10:18:01,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:18:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-10-02 10:18:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 10:18:01,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:01,144 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1] [2019-10-02 10:18:01,145 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash -75669472, now seen corresponding path program 1 times [2019-10-02 10:18:01,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:01,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:01,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:01,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:01,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:01,301 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 10:18:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:01,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:18:01,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:01,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 10:18:01,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:18:01,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:18:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:18:01,448 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 5 states. [2019-10-02 10:18:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:01,497 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2019-10-02 10:18:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:18:01,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-02 10:18:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:01,499 INFO L225 Difference]: With dead ends: 77 [2019-10-02 10:18:01,499 INFO L226 Difference]: Without dead ends: 45 [2019-10-02 10:18:01,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:18:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-02 10:18:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-02 10:18:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 10:18:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-10-02 10:18:01,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 43 [2019-10-02 10:18:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-02 10:18:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:18:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-10-02 10:18:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 10:18:01,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:01,523 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1] [2019-10-02 10:18:01,524 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash -176141410, now seen corresponding path program 2 times [2019-10-02 10:18:01,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:01,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:01,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:01,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:01,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:18:02,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:02,168 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:02,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:18:02,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 10:18:02,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:18:02,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 10:18:02,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:02,361 INFO L375 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-10-02 10:18:02,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:02,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:02,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:02,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-02 10:18:02,457 INFO L375 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-10-02 10:18:02,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:02,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:02,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:02,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 10:18:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:02,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:18:02,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 10:18:02,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 10:18:02,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 10:18:02,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:18:02,502 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 21 states. [2019-10-02 10:18:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:04,722 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2019-10-02 10:18:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 10:18:04,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-02 10:18:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:04,726 INFO L225 Difference]: With dead ends: 143 [2019-10-02 10:18:04,726 INFO L226 Difference]: Without dead ends: 126 [2019-10-02 10:18:04,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=467, Invalid=2395, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 10:18:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-02 10:18:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2019-10-02 10:18:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-02 10:18:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2019-10-02 10:18:04,750 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 45 [2019-10-02 10:18:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:04,750 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2019-10-02 10:18:04,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 10:18:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2019-10-02 10:18:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 10:18:04,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:04,753 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1] [2019-10-02 10:18:04,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:04,754 INFO L82 PathProgramCache]: Analyzing trace with hash -938142676, now seen corresponding path program 1 times [2019-10-02 10:18:04,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:04,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:04,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:18:04,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 10:18:04,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:04,813 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:04,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:04,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:18:04,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:18:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:04,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 10:18:04,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:18:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:18:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:18:04,926 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand 5 states. [2019-10-02 10:18:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:04,968 INFO L93 Difference]: Finished difference Result 169 states and 216 transitions. [2019-10-02 10:18:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:18:04,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-02 10:18:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:04,971 INFO L225 Difference]: With dead ends: 169 [2019-10-02 10:18:04,972 INFO L226 Difference]: Without dead ends: 104 [2019-10-02 10:18:04,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:18:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-02 10:18:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-10-02 10:18:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-02 10:18:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-10-02 10:18:04,999 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 49 [2019-10-02 10:18:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:05,000 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-10-02 10:18:05,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:18:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-10-02 10:18:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 10:18:05,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:05,007 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-10-02 10:18:05,012 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2074490512, now seen corresponding path program 1 times [2019-10-02 10:18:05,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:05,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:05,409 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:05,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:05,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 10:18:05,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:05,555 INFO L375 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-10-02 10:18:05,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:05,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:05,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:05,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-02 10:18:05,627 INFO L375 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-10-02 10:18:05,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:05,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:05,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:05,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 10:18:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:05,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:05,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-10-02 10:18:05,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 10:18:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 10:18:05,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 10:18:05,642 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 19 states. [2019-10-02 10:18:06,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:06,513 INFO L93 Difference]: Finished difference Result 183 states and 236 transitions. [2019-10-02 10:18:06,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 10:18:06,514 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-10-02 10:18:06,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:06,516 INFO L225 Difference]: With dead ends: 183 [2019-10-02 10:18:06,516 INFO L226 Difference]: Without dead ends: 156 [2019-10-02 10:18:06,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 10:18:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-02 10:18:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-10-02 10:18:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-02 10:18:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 192 transitions. [2019-10-02 10:18:06,541 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 192 transitions. Word has length 51 [2019-10-02 10:18:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:06,541 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 192 transitions. [2019-10-02 10:18:06,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 10:18:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 192 transitions. [2019-10-02 10:18:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 10:18:06,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:06,543 INFO L411 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 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, 1] [2019-10-02 10:18:06,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1299631036, now seen corresponding path program 1 times [2019-10-02 10:18:06,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:06,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:06,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:18:07,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:07,239 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:07,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:07,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-02 10:18:07,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:07,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 21 [2019-10-02 10:18:07,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 10:18:07,365 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 10:18:07,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:07,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-10-02 10:18:07,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-10-02 10:18:07,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:07,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:07,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:07,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:17 [2019-10-02 10:18:07,687 INFO L375 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 9 treesize of output 3 [2019-10-02 10:18:07,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:07,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:07,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:07,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-10-02 10:18:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:18:07,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:07,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-10-02 10:18:07,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 10:18:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 10:18:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 10:18:07,867 INFO L87 Difference]: Start difference. First operand 151 states and 192 transitions. Second operand 35 states. [2019-10-02 10:18:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:10,201 INFO L93 Difference]: Finished difference Result 218 states and 273 transitions. [2019-10-02 10:18:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 10:18:10,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2019-10-02 10:18:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:10,206 INFO L225 Difference]: With dead ends: 218 [2019-10-02 10:18:10,206 INFO L226 Difference]: Without dead ends: 123 [2019-10-02 10:18:10,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=477, Invalid=2945, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 10:18:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-02 10:18:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2019-10-02 10:18:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-02 10:18:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2019-10-02 10:18:10,221 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 51 [2019-10-02 10:18:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:10,221 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2019-10-02 10:18:10,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 10:18:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2019-10-02 10:18:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 10:18:10,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:10,223 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-10-02 10:18:10,223 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1038104393, now seen corresponding path program 1 times [2019-10-02 10:18:10,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:10,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 10:18:10,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:10,919 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:10,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:10,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-02 10:18:11,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:11,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 30 [2019-10-02 10:18:11,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,027 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-10-02 10:18:11,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-10-02 10:18:11,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-02 10:18:11,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-02 10:18:11,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:22 [2019-10-02 10:18:11,351 INFO L375 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-10-02 10:18:11,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,374 INFO L375 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-10-02 10:18:11,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,381 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-10-02 10:18:11,532 INFO L375 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 22 treesize of output 10 [2019-10-02 10:18:11,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,545 INFO L375 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 22 treesize of output 10 [2019-10-02 10:18:11,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:11,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:11,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:13 [2019-10-02 10:18:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 10:18:11,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:11,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2019-10-02 10:18:11,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 10:18:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 10:18:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 10:18:11,608 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand 38 states. [2019-10-02 10:18:13,518 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-02 10:18:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:14,344 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2019-10-02 10:18:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 10:18:14,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 53 [2019-10-02 10:18:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:14,346 INFO L225 Difference]: With dead ends: 163 [2019-10-02 10:18:14,346 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 10:18:14,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=433, Invalid=2873, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 10:18:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 10:18:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2019-10-02 10:18:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 10:18:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-10-02 10:18:14,375 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 53 [2019-10-02 10:18:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:14,375 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-10-02 10:18:14,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 10:18:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-10-02 10:18:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 10:18:14,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:14,377 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-10-02 10:18:14,377 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1344139440, now seen corresponding path program 1 times [2019-10-02 10:18:14,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:14,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:14,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 10:18:14,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:14,447 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:14,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:14,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 10:18:14,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 10:18:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:18:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-10-02 10:18:14,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:18:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:18:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:18:14,558 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 6 states. [2019-10-02 10:18:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:14,596 INFO L93 Difference]: Finished difference Result 138 states and 165 transitions. [2019-10-02 10:18:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:18:14,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 10:18:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:14,598 INFO L225 Difference]: With dead ends: 138 [2019-10-02 10:18:14,598 INFO L226 Difference]: Without dead ends: 82 [2019-10-02 10:18:14,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:18:14,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-02 10:18:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-10-02 10:18:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-02 10:18:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-10-02 10:18:14,609 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 56 [2019-10-02 10:18:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:14,609 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-10-02 10:18:14,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:18:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-10-02 10:18:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 10:18:14,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:14,610 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:18:14,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359541, now seen corresponding path program 1 times [2019-10-02 10:18:14,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 10:18:15,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:15,252 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:15,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 10:18:15,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:15,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 21 [2019-10-02 10:18:15,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 10:18:15,374 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-10-02 10:18:15,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:15,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-10-02 10:18:15,758 INFO L375 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 23 treesize of output 11 [2019-10-02 10:18:15,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:15,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:15,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:15,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-10-02 10:18:15,911 INFO L375 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-10-02 10:18:15,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:15,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:15,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:15,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-02 10:18:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 10:18:15,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:15,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2019-10-02 10:18:15,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 10:18:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 10:18:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 10:18:15,962 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 36 states. [2019-10-02 10:18:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:17,717 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2019-10-02 10:18:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 10:18:17,717 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 61 [2019-10-02 10:18:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:17,719 INFO L225 Difference]: With dead ends: 128 [2019-10-02 10:18:17,719 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 10:18:17,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=2226, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 10:18:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 10:18:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-10-02 10:18:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 10:18:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-10-02 10:18:17,729 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 61 [2019-10-02 10:18:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:17,729 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-10-02 10:18:17,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 10:18:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-10-02 10:18:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 10:18:17,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:17,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:18:17,731 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:17,731 INFO L82 PathProgramCache]: Analyzing trace with hash -426052747, now seen corresponding path program 2 times [2019-10-02 10:18:17,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:17,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:17,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:18:17,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:18:18,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:18,864 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:18:18,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:18:18,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:18:18,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 10:18:18,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:18,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 30 [2019-10-02 10:18:18,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:18,986 INFO L567 ElimStorePlain]: treesize reduction 12, result has 47.8 percent of original size [2019-10-02 10:18:18,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:18,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2019-10-02 10:18:19,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-10-02 10:18:19,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:19,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:19,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:19,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:17 [2019-10-02 10:18:19,508 INFO L375 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 9 treesize of output 3 [2019-10-02 10:18:19,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:19,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:19,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:19,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-10-02 10:18:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:18:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:19,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 48 [2019-10-02 10:18:19,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-02 10:18:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-02 10:18:19,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2096, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 10:18:19,718 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 48 states. [2019-10-02 10:18:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:22,357 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-10-02 10:18:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 10:18:22,358 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2019-10-02 10:18:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:22,359 INFO L225 Difference]: With dead ends: 101 [2019-10-02 10:18:22,359 INFO L226 Difference]: Without dead ends: 65 [2019-10-02 10:18:22,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-02 10:18:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-02 10:18:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-02 10:18:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 10:18:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-10-02 10:18:22,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2019-10-02 10:18:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:22,372 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-10-02 10:18:22,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-02 10:18:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-10-02 10:18:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 10:18:22,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:18:22,373 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-10-02 10:18:22,373 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:18:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:18:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1890879125, now seen corresponding path program 3 times [2019-10-02 10:18:22,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:18:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:18:22,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:22,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:18:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:18:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:18:23,337 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-02 10:18:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:18:24,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:18:24,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:18:24,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:18:25,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:18:25,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:18:25,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 10:18:25,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:18:25,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 30 [2019-10-02 10:18:25,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,159 INFO L567 ElimStorePlain]: treesize reduction 12, result has 40.0 percent of original size [2019-10-02 10:18:25,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:8 [2019-10-02 10:18:25,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2019-10-02 10:18:25,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:25,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:14 [2019-10-02 10:18:25,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2019-10-02 10:18:25,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:25,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:18:25,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:8 [2019-10-02 10:18:26,933 WARN L191 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 10:18:26,949 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:18:26,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:18:26,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:18:26,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:34 [2019-10-02 10:18:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 10:18:28,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:18:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22] total 56 [2019-10-02 10:18:28,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 10:18:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 10:18:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2901, Unknown=1, NotChecked=0, Total=3080 [2019-10-02 10:18:28,490 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 56 states. [2019-10-02 10:18:29,300 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 10:18:29,630 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-02 10:18:31,101 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2019-10-02 10:18:35,210 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-10-02 10:18:39,550 WARN L191 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 106 DAG size of output: 81 [2019-10-02 10:18:43,809 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-10-02 10:18:47,284 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-10-02 10:18:49,654 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-10-02 10:18:50,063 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2019-10-02 10:18:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:18:50,192 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2019-10-02 10:18:50,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 10:18:50,192 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 66 [2019-10-02 10:18:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:18:50,193 INFO L225 Difference]: With dead ends: 65 [2019-10-02 10:18:50,193 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 10:18:50,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=542, Invalid=6263, Unknown=1, NotChecked=0, Total=6806 [2019-10-02 10:18:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 10:18:50,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 10:18:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 10:18:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 10:18:50,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2019-10-02 10:18:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:18:50,197 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 10:18:50,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-02 10:18:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 10:18:50,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 10:18:50,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 10:18:57,126 WARN L191 SmtUtils]: Spent 6.61 s on a formula simplification. DAG size of input: 183 DAG size of output: 119 [2019-10-02 10:18:57,274 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-02 10:18:57,588 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2019-10-02 10:18:57,744 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-10-02 10:18:57,910 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-10-02 10:18:58,056 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-10-02 10:18:58,328 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-10-02 10:18:58,472 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-02 10:18:58,684 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 67 [2019-10-02 10:18:58,919 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-10-02 10:18:58,923 INFO L439 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= ~counter~0 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,924 INFO L443 ceAbstractionStarter]: For program point L17-2(lines 17 20) no Hoare annotation was computed. [2019-10-02 10:18:58,924 INFO L439 ceAbstractionStarter]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (and (= init_~i~0 0) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse6 (@diff .cse0 .cse4)) (.cse5 (@diff .cse2 .cse3))) (and (= (select .cse3 0) 0) (= (select .cse4 0) 0) (= .cse3 (store .cse2 .cse5 (select .cse3 .cse5))) (= (store .cse0 .cse6 (select .cse4 .cse6)) .cse4) (or (not (= .cse6 .cse1)) (= .cse0 .cse4)) (< 0 init_~i~0) (or (= .cse2 .cse3) (not (= .cse5 .cse1)))))) (not (= ~counter~0 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,924 INFO L443 ceAbstractionStarter]: For program point L17-4(lines 15 21) no Hoare annotation was computed. [2019-10-02 10:18:58,924 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2019-10-02 10:18:58,924 INFO L443 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2019-10-02 10:18:58,925 INFO L443 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2019-10-02 10:18:58,925 INFO L439 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (or (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 (select .cse2 .cse1))) (or (not (= 0 |~#pstate~0.offset|)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0))))) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 |~#pp~0.offset|)))) [2019-10-02 10:18:58,925 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:18:58,925 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~counter~0 |old(~counter~0)|) [2019-10-02 10:18:58,925 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:18:58,925 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2019-10-02 10:18:58,926 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 31) no Hoare annotation was computed. [2019-10-02 10:18:58,926 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 31) the Hoare annotation is: (let ((.cse11 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse6 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse7 (= |#memory_int| |old(#memory_int)|)) (.cse8 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse9 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse12 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse13 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= 0 (select .cse12 .cse13)))) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse2 (= |~#pstate~0.base| |~#pp~0.base|)) (.cse10 (and (= f_~pointer.base |f_#in~pointer.base|) .cse6 .cse7 (= f_~i~1 0) .cse8 .cse9)) (.cse3 (not (= 0 (select .cse11 .cse13)))) (.cse4 (not (= 0 |~#pp~0.offset|))) (.cse5 (= (select .cse12 0) 0))) (and (or .cse0 (not (= 1 (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse1 .cse2 .cse3 .cse4 .cse5 (and (= (* 4 f_~i~1) 4) .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 (not (= (select .cse11 0) 0)) (not .cse5))))) [2019-10-02 10:18:58,926 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 23 32) no Hoare annotation was computed. [2019-10-02 10:18:58,926 INFO L443 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2019-10-02 10:18:58,926 INFO L439 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse7 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse8 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse9 (+ |~#pp~0.offset| 4))) (let ((.cse0 (not (= 0 (select .cse8 .cse9)))) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse2 (= |~#pstate~0.base| |~#pp~0.base|)) (.cse3 (not (= 0 (select .cse7 .cse9)))) (.cse4 (not (= 0 |~#pp~0.offset|))) (.cse5 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (.cse6 (= (select .cse8 0) 0))) (and (or .cse0 (not (= 1 (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (select .cse7 0) 0)) .cse5 (not .cse6))))) [2019-10-02 10:18:58,927 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 42) no Hoare annotation was computed. [2019-10-02 10:18:58,927 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 42) the Hoare annotation is: (let ((.cse14 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse22 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse31 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse32 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (let ((.cse33 (@diff .cse31 .cse32)) (.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse18 (+ |~#pstate~0.offset| 4)) (.cse15 (+ |~#pp~0.offset| 4)) (.cse16 (= .cse14 .cse22)) (.cse34 (@diff .cse14 .cse22))) (let ((.cse8 (<= 2 g_~i~2)) (.cse3 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse27 (= (store .cse14 .cse34 (select .cse22 .cse34)) .cse22)) (.cse28 (or (not (= .cse34 .cse15)) .cse16)) (.cse11 (= 1 (select .cse2 .cse18))) (.cse29 (= .cse32 (store .cse31 .cse33 (select .cse32 .cse33)))) (.cse30 (or (= .cse31 .cse32) (not (= .cse33 .cse15)))) (.cse26 (= 0 |~#pp~0.offset|))) (let ((.cse7 (= 1 (select .cse2 .cse15))) (.cse21 (= g_~i~2 0)) (.cse5 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse12 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse13 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse25 (and .cse27 (= g_~i~2 1) .cse28 .cse11 .cse29 .cse30 .cse26)) (.cse9 (not (= 1 (select .cse3 |~#pstate~0.offset|)))) (.cse19 (not (= 0 |~#pstate~0.offset|))) (.cse24 (and (= |~#pstate~0.offset| 0) .cse27 .cse28 .cse8 .cse29 .cse30)) (.cse23 (not (= 1 (select .cse3 .cse15)))) (.cse20 (= |~#pstate~0.base| |~#pp~0.base|)) (.cse17 (not .cse26))) (and (let ((.cse0 (= |g_#in~pointer.offset| (select .cse22 |~#pp~0.offset|))) (.cse1 (<= 1 g_~i~2)) (.cse10 (= (select .cse2 |~#pstate~0.offset|) 1))) (or (let ((.cse4 (@diff .cse3 .cse2))) (and .cse0 .cse1 (or (= .cse2 .cse3) (and (= 0 (mod (+ |~#pstate~0.offset| (* 3 .cse4)) 4)) (<= 0 (div (+ |~#pstate~0.offset| (* (- 1) .cse4)) 4)))) .cse5 (exists ((g_~i~2 Int)) (= (store |old(#memory_$Pointer$.offset)| |~#pstate~0.base| (let ((.cse6 (+ (* 4 g_~i~2) |~#pstate~0.offset|))) (store (select |old(#memory_$Pointer$.offset)| |~#pstate~0.base|) .cse6 (select (select |#memory_$Pointer$.offset| |~#pstate~0.base|) .cse6)))) |#memory_$Pointer$.offset|)) (= .cse2 (store .cse3 .cse4 (select .cse2 .cse4))))) (and .cse0 .cse7 .cse8) .cse9 (and .cse10 .cse1 .cse11 .cse12 .cse13 .cse5) (and (= |g_#in~pointer.offset| (select .cse14 .cse15)) .cse16 .cse8) .cse17 (and .cse10 .cse7 .cse12 .cse8 .cse13) (not (= (select .cse3 .cse18) 1)) .cse19 .cse20 (and (= |#memory_int| |old(#memory_int)|) .cse21 .cse5))) (or .cse23 .cse24 (not (= 1 (select .cse14 |~#pp~0.offset|))) .cse17 (and .cse7 .cse12 .cse21 .cse13 .cse5) .cse25 .cse19 .cse20 (not (= |g_#in~pointer.offset| 2))) (or (and .cse12 .cse13) .cse25 .cse9 .cse19 .cse24 .cse23 .cse20 .cse17)))))) [2019-10-02 10:18:58,927 INFO L443 ceAbstractionStarter]: For program point L36-4(lines 34 43) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L439 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= 0 |~#pstate~0.offset|))) (.cse1 (not (= 1 (select .cse4 (+ |~#pp~0.offset| 4))))) (.cse2 (= |~#pstate~0.base| |~#pp~0.base|)) (.cse3 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 .cse2 (not (= 1 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) |~#pp~0.offset|))) .cse3 (not (= |g_#in~pointer.offset| 2))) (or (not (= 1 (select .cse4 |~#pstate~0.offset|))) .cse0 .cse1 .cse2 .cse3)))) [2019-10-02 10:18:58,928 INFO L439 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse7 (+ |~#pp~0.offset| 4)) (.cse8 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= 1 (select .cse8 |~#pstate~0.offset|)))) (.cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse6 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse2 (not (= 1 (select .cse8 .cse7)))) (.cse3 (= |~#pstate~0.base| |~#pp~0.base|)) (.cse4 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6)) (or .cse0 .cse1 .cse2 .cse3 .cse4 (= |#memory_int| |old(#memory_int)|)) (or (and (= 1 (select (select |#memory_int| |~#pstate~0.base|) .cse7)) .cse5 .cse6) .cse1 .cse2 .cse3 (not (= 1 (select (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|) |~#pp~0.offset|))) .cse4 (not (= |g_#in~pointer.offset| 2)))))) [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2019-10-02 10:18:58,928 INFO L443 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2019-10-02 10:18:58,929 INFO L446 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2019-10-02 10:18:58,929 INFO L443 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-02 10:18:58,929 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 10:18:58,929 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |~#pstate~0.offset| 0) (= (select .cse0 .cse1) 0) (= 0 (select .cse2 .cse1)) (= ~counter~0 1) (= (select .cse0 0) 0) (= (select .cse2 0) 0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= 0 |~#pp~0.offset|))) [2019-10-02 10:18:58,929 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 10:18:58,929 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 10:18:58,929 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 10:18:58,929 INFO L439 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse5 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (+ |~#pp~0.offset| 4))) (let ((.cse2 (= 0 main_~a~0.base)) (.cse3 (= 1 (select .cse5 .cse1))) (.cse4 (= main_~a~0.offset 1)) (.cse6 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (and .cse2 .cse3 .cse4 (= main_~b~0.offset 2) (not (= ~counter~0 1)) (= 1 (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|))) (and .cse2 (= (select .cse5 |~#pstate~0.offset|) 1) .cse3 .cse4) (not (= 0 (select .cse6 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse6 0) 0)) (not (= (select .cse0 0) 0))))) [2019-10-02 10:18:58,930 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (= ~counter~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,930 INFO L439 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse4 (select |#memory_int| |~#pstate~0.base|))) (and (= 0 main_~a~0.base) (not (= main_~b~0.offset (select .cse3 0))) (= main_~a~0.offset 1) (= 2 (select .cse3 .cse1)) (= (select .cse4 |~#pstate~0.offset|) 1) (= 1 (select .cse4 .cse1)) (= main_~b~0.offset 2) (not (= ~counter~0 1)))) (not (= |old(~counter~0)| 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,930 INFO L439 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse6 (@diff .cse0 .cse4)) (.cse5 (@diff .cse2 .cse3))) (and (= 0 main_~a~0.base) (= main_~a~0.offset 1) (= (select .cse3 0) 0) (= (select .cse4 0) 0) (= .cse3 (store .cse2 .cse5 (select .cse3 .cse5))) (= (store .cse0 .cse6 (select .cse4 .cse6)) .cse4) (or (not (= .cse6 .cse1)) (= .cse0 .cse4)) (= main_~b~0.offset 2) (not (= ~counter~0 1)) (or (= .cse2 .cse3) (not (= .cse5 .cse1)))))) (not (= |old(~counter~0)| 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,930 INFO L439 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse4 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (let ((.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 main_~a~0.base) (= (select .cse2 .cse1) 0) (= (select .cse2 |~#pp~0.offset|) main_~a~0.base) (= main_~a~0.offset 1) (= main_~a~0.offset (select .cse3 |~#pp~0.offset|)) (= 0 (select .cse3 .cse1)) (= (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|) 1) (= main_~b~0.offset 2) (not (= ~counter~0 1)))) (not (= 0 (select .cse4 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse4 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,930 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2019-10-02 10:18:58,930 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2019-10-02 10:18:58,931 INFO L439 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse4 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (let ((.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse6 (@diff .cse0 .cse3)) (.cse5 (@diff .cse4 .cse2))) (and (= 0 main_~a~0.base) (= (select .cse2 0) 0) (= (select .cse3 0) 0) (= .cse2 (store .cse4 .cse5 (select .cse2 .cse5))) (= (store .cse0 .cse6 (select .cse3 .cse6)) .cse3) (= (+ main_~a~0.offset 1) ~counter~0) (= ~counter~0 2) (or (not (= .cse6 .cse1)) (= .cse0 .cse3)) (or (= .cse4 .cse2) (not (= .cse5 .cse1)))))) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse4 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse4 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,931 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 10:18:58,931 INFO L443 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2019-10-02 10:18:58,931 INFO L439 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (and (= ~counter~0 1) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |~#pstate~0.base| |~#pp~0.base|) (not (= 0 (select .cse2 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse2 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,931 INFO L439 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse1 (+ |~#pp~0.offset| 4)) (.cse4 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= 0 (select .cse0 .cse1))) (not (= 0 |~#pstate~0.offset|)) (= |~#pstate~0.base| |~#pp~0.base|) (let ((.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse6 (@diff .cse0 .cse3)) (.cse5 (@diff .cse4 .cse2))) (and (= (select .cse2 0) 0) (= (select .cse3 0) 0) (= .cse2 (store .cse4 .cse5 (select .cse2 .cse5))) (= (store .cse0 .cse6 (select .cse3 .cse6)) .cse3) (= ~counter~0 |old(~counter~0)|) (or (not (= .cse6 .cse1)) (= .cse0 .cse3)) (or (= .cse4 .cse2) (not (= .cse5 .cse1)))))) (not (= 0 (select .cse4 .cse1))) (not (= 0 |~#pp~0.offset|)) (not (= |old(~counter~0)| 1)) (not (= (select .cse4 0) 0)) (not (= (select .cse0 0) 0)))) [2019-10-02 10:18:58,931 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2019-10-02 10:18:58,938 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 10:18:58,942 INFO L168 Benchmark]: Toolchain (without parser) took 59557.56 ms. Allocated memory was 140.0 MB in the beginning and 514.3 MB in the end (delta: 374.3 MB). Free memory was 87.8 MB in the beginning and 458.3 MB in the end (delta: -370.6 MB). Peak memory consumption was 375.2 MB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,942 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.35 ms. Allocated memory is still 140.0 MB. Free memory was 87.5 MB in the beginning and 77.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,943 INFO L168 Benchmark]: Boogie Preprocessor took 134.79 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 77.0 MB in the beginning and 176.4 MB in the end (delta: -99.4 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,944 INFO L168 Benchmark]: RCFGBuilder took 451.62 ms. Allocated memory is still 200.3 MB. Free memory was 176.4 MB in the beginning and 155.3 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,945 INFO L168 Benchmark]: TraceAbstraction took 58636.20 ms. Allocated memory was 200.3 MB in the beginning and 514.3 MB in the end (delta: 314.0 MB). Free memory was 154.7 MB in the beginning and 458.3 MB in the end (delta: -303.6 MB). Peak memory consumption was 381.8 MB. Max. memory is 7.1 GB. [2019-10-02 10:18:58,948 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.25 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.35 ms. Allocated memory is still 140.0 MB. Free memory was 87.5 MB in the beginning and 77.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.79 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 77.0 MB in the beginning and 176.4 MB in the end (delta: -99.4 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 451.62 ms. Allocated memory is still 200.3 MB. Free memory was 176.4 MB in the beginning and 155.3 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58636.20 ms. Allocated memory was 200.3 MB in the beginning and 514.3 MB in the end (delta: 314.0 MB). Free memory was 154.7 MB in the beginning and 458.3 MB in the end (delta: -303.6 MB). Peak memory consumption was 381.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:553) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...