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/array-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:48:45,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:48:45,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:48:45,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:48:45,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:48:45,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:48:45,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:48:45,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:48:45,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:48:45,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:48:45,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:48:45,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:48:45,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:48:45,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:48:45,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:48:45,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:48:45,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:48:45,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:48:45,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:48:45,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:48:45,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:48:45,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:48:45,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:48:45,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:48:45,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:48:45,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:48:45,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:48:45,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:48:45,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:48:45,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:48:45,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:48:45,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:48:45,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:48:45,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:48:45,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:48:45,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:48:45,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:48:45,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:48:45,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:48:45,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:48:45,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:48:45,666 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-13 17:48:45,680 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:48:45,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:48:45,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:48:45,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:48:45,682 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:48:45,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:48:45,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:48:45,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:48:45,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:48:45,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:48:45,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:48:45,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:48:45,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:48:45,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:48:45,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:48:45,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:48:45,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:48:45,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:48:45,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:48:45,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:48:45,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:48:45,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:48:45,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:48:45,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:48:46,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:48:46,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:48:46,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:48:46,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:48:46,115 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:48:46,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-10-13 17:48:46,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade104ca6/83a0e6e1dbd64834b9297ef9e41d92a8/FLAG44fc4f1cc [2019-10-13 17:48:46,659 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:48:46,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-10-13 17:48:46,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade104ca6/83a0e6e1dbd64834b9297ef9e41d92a8/FLAG44fc4f1cc [2019-10-13 17:48:47,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade104ca6/83a0e6e1dbd64834b9297ef9e41d92a8 [2019-10-13 17:48:47,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:48:47,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:48:47,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:48:47,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:48:47,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:48:47,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6836b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47, skipping insertion in model container [2019-10-13 17:48:47,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,040 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:48:47,058 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:48:47,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:48:47,332 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:48:47,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:48:47,381 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:48:47,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47 WrapperNode [2019-10-13 17:48:47,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:48:47,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:48:47,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:48:47,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:48:47,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (1/1) ... [2019-10-13 17:48:47,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:48:47,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:48:47,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:48:47,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:48:47,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (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-13 17:48:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:48:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:48:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 17:48:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 17:48:47,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:48:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 17:48:47,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:48:47,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 17:48:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 17:48:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 17:48:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:48:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:48:47,880 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:48:47,881 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 17:48:47,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:47 BoogieIcfgContainer [2019-10-13 17:48:47,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:48:47,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:48:47,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:48:47,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:48:47,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:48:47" (1/3) ... [2019-10-13 17:48:47,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ec8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:47, skipping insertion in model container [2019-10-13 17:48:47,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:47" (2/3) ... [2019-10-13 17:48:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228ec8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:47, skipping insertion in model container [2019-10-13 17:48:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:47" (3/3) ... [2019-10-13 17:48:47,903 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-10-13 17:48:47,916 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:48:47,932 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:48:47,963 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:48:47,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:48:47,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:48:47,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:48:47,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:48:47,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:48:47,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:48:47,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:48:47,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:48:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-13 17:48:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 17:48:48,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:48,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:48,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2019-10-13 17:48:48,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:48,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940425128] [2019-10-13 17:48:48,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:48:48,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940425128] [2019-10-13 17:48:48,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:48:48,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:48:48,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040449350] [2019-10-13 17:48:48,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 17:48:48,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 17:48:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:48:48,286 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-10-13 17:48:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:48,488 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2019-10-13 17:48:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:48:48,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 17:48:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:48,506 INFO L225 Difference]: With dead ends: 59 [2019-10-13 17:48:48,506 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 17:48:48,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:48:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 17:48:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-10-13 17:48:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 17:48:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-13 17:48:48,583 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-10-13 17:48:48,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:48,585 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-13 17:48:48,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 17:48:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-13 17:48:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 17:48:48,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:48,587 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:48,587 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2019-10-13 17:48:48,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:48,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552194991] [2019-10-13 17:48:48,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:48:48,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552194991] [2019-10-13 17:48:48,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:48:48,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:48:48,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121507378] [2019-10-13 17:48:48,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:48:48,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:48:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:48:48,733 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2019-10-13 17:48:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:48,911 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-10-13 17:48:48,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:48:48,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-13 17:48:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:48,914 INFO L225 Difference]: With dead ends: 51 [2019-10-13 17:48:48,914 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 17:48:48,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:48:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 17:48:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-10-13 17:48:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 17:48:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 17:48:48,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-10-13 17:48:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:48,929 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 17:48:48,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:48:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 17:48:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 17:48:48,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:48,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:48,931 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:48,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1976547036, now seen corresponding path program 1 times [2019-10-13 17:48:48,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:48,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888707927] [2019-10-13 17:48:48,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:48,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:48:49,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888707927] [2019-10-13 17:48:49,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:48:49,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:48:49,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644451755] [2019-10-13 17:48:49,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:48:49,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:49,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:48:49,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:48:49,090 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-13 17:48:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:49,232 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-10-13 17:48:49,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:48:49,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-10-13 17:48:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:49,234 INFO L225 Difference]: With dead ends: 50 [2019-10-13 17:48:49,234 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 17:48:49,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:48:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 17:48:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-10-13 17:48:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 17:48:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-13 17:48:49,242 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2019-10-13 17:48:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:49,242 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-13 17:48:49,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:48:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-13 17:48:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 17:48:49,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:49,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:49,244 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:49,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1583520026, now seen corresponding path program 1 times [2019-10-13 17:48:49,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:49,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632987005] [2019-10-13 17:48:49,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:49,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:49,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:48:49,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632987005] [2019-10-13 17:48:49,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:48:49,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 17:48:49,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705806481] [2019-10-13 17:48:49,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:48:49,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:48:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:48:49,377 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2019-10-13 17:48:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:49,556 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-13 17:48:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:48:49,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-13 17:48:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:49,558 INFO L225 Difference]: With dead ends: 50 [2019-10-13 17:48:49,558 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 17:48:49,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 17:48:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 17:48:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-13 17:48:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 17:48:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-13 17:48:49,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2019-10-13 17:48:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:49,566 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-13 17:48:49,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:48:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-13 17:48:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 17:48:49,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:49,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:49,568 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -596099560, now seen corresponding path program 1 times [2019-10-13 17:48:49,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:49,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404287333] [2019-10-13 17:48:49,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:49,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:49,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:48:49,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404287333] [2019-10-13 17:48:49,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000331471] [2019-10-13 17:48:49,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:49,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 17:48:49,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:48:49,945 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:49,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-13 17:48:49,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885717865] [2019-10-13 17:48:49,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 17:48:49,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:49,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 17:48:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:48:49,948 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2019-10-13 17:48:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:50,288 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-13 17:48:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:48:50,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-13 17:48:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:50,290 INFO L225 Difference]: With dead ends: 52 [2019-10-13 17:48:50,290 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 17:48:50,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:48:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 17:48:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-13 17:48:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 17:48:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-13 17:48:50,297 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2019-10-13 17:48:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:50,298 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-13 17:48:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 17:48:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-13 17:48:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 17:48:50,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:50,300 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 17:48:50,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:50,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash 733518742, now seen corresponding path program 2 times [2019-10-13 17:48:50,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:50,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563212857] [2019-10-13 17:48:50,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:50,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:50,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:48:50,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563212857] [2019-10-13 17:48:50,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17857615] [2019-10-13 17:48:50,736 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:50,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:48:50,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 17:48:50,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 17:48:50,852 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:50,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-10-13 17:48:50,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889384788] [2019-10-13 17:48:50,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 17:48:50,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 17:48:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:48:50,856 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2019-10-13 17:48:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:51,107 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-10-13 17:48:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 17:48:51,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-10-13 17:48:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:51,109 INFO L225 Difference]: With dead ends: 69 [2019-10-13 17:48:51,109 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 17:48:51,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:48:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 17:48:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-10-13 17:48:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 17:48:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-13 17:48:51,117 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-10-13 17:48:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:51,118 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-13 17:48:51,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 17:48:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-13 17:48:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 17:48:51,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:51,119 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:51,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:51,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 64390350, now seen corresponding path program 3 times [2019-10-13 17:48:51,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:51,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33852684] [2019-10-13 17:48:51,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:51,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:51,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:48:51,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33852684] [2019-10-13 17:48:51,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617149428] [2019-10-13 17:48:51,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:51,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 17:48:51,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:51,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:48:51,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:48:51,643 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:51,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-13 17:48:51,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113889502] [2019-10-13 17:48:51,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 17:48:51,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 17:48:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-13 17:48:51,645 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 12 states. [2019-10-13 17:48:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:51,915 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-10-13 17:48:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:48:51,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-10-13 17:48:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:51,917 INFO L225 Difference]: With dead ends: 82 [2019-10-13 17:48:51,917 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 17:48:51,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:48:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 17:48:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-13 17:48:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 17:48:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-13 17:48:51,932 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-10-13 17:48:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:51,933 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-13 17:48:51,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 17:48:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-13 17:48:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 17:48:51,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:51,936 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:52,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:52,142 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1628887214, now seen corresponding path program 4 times [2019-10-13 17:48:52,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:52,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275552280] [2019-10-13 17:48:52,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:52,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:52,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:48:52,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275552280] [2019-10-13 17:48:52,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084366792] [2019-10-13 17:48:52,395 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:52,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:48:52,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:52,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 17:48:52,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:48:52,576 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:52,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-10-13 17:48:52,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116358827] [2019-10-13 17:48:52,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 17:48:52,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 17:48:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:48:52,578 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 16 states. [2019-10-13 17:48:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:52,984 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-13 17:48:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 17:48:52,984 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-10-13 17:48:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:52,985 INFO L225 Difference]: With dead ends: 70 [2019-10-13 17:48:52,986 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 17:48:52,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-10-13 17:48:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 17:48:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-13 17:48:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 17:48:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-13 17:48:52,995 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2019-10-13 17:48:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:52,995 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-13 17:48:52,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 17:48:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-13 17:48:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 17:48:52,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:52,997 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:53,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:53,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash 201537488, now seen corresponding path program 5 times [2019-10-13 17:48:53,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:53,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844723589] [2019-10-13 17:48:53,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:53,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:53,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:48:53,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844723589] [2019-10-13 17:48:53,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401251284] [2019-10-13 17:48:53,497 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:53,561 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-13 17:48:53,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:53,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 17:48:53,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:48:53,627 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:53,627 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-13 17:48:53,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850881332] [2019-10-13 17:48:53,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 17:48:53,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:53,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 17:48:53,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:48:53,629 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 15 states. [2019-10-13 17:48:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:53,938 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-10-13 17:48:53,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 17:48:53,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-10-13 17:48:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:53,939 INFO L225 Difference]: With dead ends: 97 [2019-10-13 17:48:53,939 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 17:48:53,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-10-13 17:48:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 17:48:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-10-13 17:48:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 17:48:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-13 17:48:53,947 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2019-10-13 17:48:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:53,947 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-13 17:48:53,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 17:48:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-13 17:48:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 17:48:53,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:53,949 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:54,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:54,153 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash 596570964, now seen corresponding path program 6 times [2019-10-13 17:48:54,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:54,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109183534] [2019-10-13 17:48:54,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:54,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:54,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 17:48:54,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109183534] [2019-10-13 17:48:54,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854500062] [2019-10-13 17:48:54,460 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:54,515 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-13 17:48:54,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:54,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 17:48:54,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:54,657 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-13 17:48:54,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:48:54,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:48:54,670 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-13 17:48:54,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:48:54,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:48:54,680 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-13 17:48:54,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 17:48:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 17:48:54,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:54,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-10-13 17:48:54,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254964013] [2019-10-13 17:48:54,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 17:48:54,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:54,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 17:48:54,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-13 17:48:54,732 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 20 states. [2019-10-13 17:48:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:55,269 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-13 17:48:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 17:48:55,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-10-13 17:48:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:55,271 INFO L225 Difference]: With dead ends: 89 [2019-10-13 17:48:55,271 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 17:48:55,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2019-10-13 17:48:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 17:48:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-13 17:48:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 17:48:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-13 17:48:55,280 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 44 [2019-10-13 17:48:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:55,281 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-13 17:48:55,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 17:48:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-13 17:48:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 17:48:55,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:55,282 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:48:55,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:55,486 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:55,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:55,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1525406971, now seen corresponding path program 1 times [2019-10-13 17:48:55,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:55,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063450082] [2019-10-13 17:48:55,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:55,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:55,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 17:48:55,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063450082] [2019-10-13 17:48:55,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:48:55,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:48:55,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412902879] [2019-10-13 17:48:55,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:48:55,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:48:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:48:55,561 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-10-13 17:48:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:55,627 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-10-13 17:48:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:48:55,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 17:48:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:55,628 INFO L225 Difference]: With dead ends: 69 [2019-10-13 17:48:55,628 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 17:48:55,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:48:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 17:48:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-13 17:48:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 17:48:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-13 17:48:55,636 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2019-10-13 17:48:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:55,636 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-13 17:48:55,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:48:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-13 17:48:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 17:48:55,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:55,638 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2019-10-13 17:48:55,638 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1923347340, now seen corresponding path program 1 times [2019-10-13 17:48:55,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:55,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360027730] [2019-10-13 17:48:55,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:55,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:55,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:48:56,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360027730] [2019-10-13 17:48:56,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811021623] [2019-10-13 17:48:56,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:56,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 17:48:56,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 17:48:56,434 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:56,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-10-13 17:48:56,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397661697] [2019-10-13 17:48:56,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 17:48:56,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 17:48:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-10-13 17:48:56,437 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 22 states. [2019-10-13 17:48:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:56,956 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-10-13 17:48:56,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:48:56,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2019-10-13 17:48:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:56,958 INFO L225 Difference]: With dead ends: 96 [2019-10-13 17:48:56,958 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 17:48:56,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 17:48:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 17:48:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-13 17:48:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 17:48:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 17:48:56,967 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2019-10-13 17:48:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:56,967 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 17:48:56,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 17:48:56,967 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 17:48:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 17:48:56,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:56,969 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 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] [2019-10-13 17:48:57,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:57,172 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2014430862, now seen corresponding path program 2 times [2019-10-13 17:48:57,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:57,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574482393] [2019-10-13 17:48:57,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:57,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:57,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:48:57,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574482393] [2019-10-13 17:48:57,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784958087] [2019-10-13 17:48:57,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:57,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:48:57,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:57,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 17:48:57,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 17:48:57,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:57,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-10-13 17:48:57,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695800244] [2019-10-13 17:48:57,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 17:48:57,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:57,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 17:48:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-10-13 17:48:57,777 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2019-10-13 17:48:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:48:58,391 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-10-13 17:48:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 17:48:58,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2019-10-13 17:48:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:48:58,392 INFO L225 Difference]: With dead ends: 98 [2019-10-13 17:48:58,392 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 17:48:58,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 17:48:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 17:48:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-13 17:48:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 17:48:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-13 17:48:58,400 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2019-10-13 17:48:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:48:58,401 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-13 17:48:58,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 17:48:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-13 17:48:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 17:48:58,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:48:58,402 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 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] [2019-10-13 17:48:58,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:58,608 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:48:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:48:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 648617712, now seen corresponding path program 3 times [2019-10-13 17:48:58,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:48:58,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294029060] [2019-10-13 17:48:58,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:58,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:48:58,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:48:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:48:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:48:59,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294029060] [2019-10-13 17:48:59,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235185393] [2019-10-13 17:48:59,062 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:48:59,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 17:48:59,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:48:59,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 17:48:59,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:48:59,201 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 15 treesize of output 11 [2019-10-13 17:48:59,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:48:59,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:48:59,219 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-13 17:48:59,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-13 17:48:59,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:48:59,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-10-13 17:48:59,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:48:59,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 17:48:59,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:48:59,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:48:59,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:48:59,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-10-13 17:48:59,539 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-13 17:48:59,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:48:59,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-10-13 17:48:59,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980969116] [2019-10-13 17:48:59,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 17:48:59,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:48:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 17:48:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-10-13 17:48:59,543 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 23 states. [2019-10-13 17:49:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:49:01,143 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-10-13 17:49:01,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 17:49:01,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2019-10-13 17:49:01,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:49:01,150 INFO L225 Difference]: With dead ends: 81 [2019-10-13 17:49:01,150 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 17:49:01,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=523, Invalid=2027, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 17:49:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 17:49:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 17:49:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 17:49:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 17:49:01,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-10-13 17:49:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:49:01,153 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 17:49:01,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 17:49:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 17:49:01,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 17:49:01,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:49:01,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 17:49:01,594 INFO L439 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 17:49:01,594 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2019-10-13 17:49:01,594 INFO L443 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-10-13 17:49:01,594 INFO L439 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and .cse0 .cse1 .cse2 (exists ((v_init_~i~0_27 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_27 4))))) (< v_init_~i~0_27 init_~size) (<= init_~i~0 (+ v_init_~i~0_27 1))))) (and (= |#valid| |old(#valid)|) (<= init_~i~0 0) .cse0 .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 17:49:01,595 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-10-13 17:49:01,595 INFO L443 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L439 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L439 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-10-13 17:49:01,596 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_init_~i~0_27 Int)) (and (< v_init_~i~0_27 100000) (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_27 4) |main_~#a~0.offset|)) 0)) (<= 99999 v_init_~i~0_27)))) (.cse1 (= main_~flag~0 0)) (.cse2 (= |main_~#a~0.offset| 0))) (or (and .cse0 .cse1 (= main_~i~1 0) .cse2) (= main_~flag~0 1) (and .cse0 (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~1 99999) .cse1 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse2))) [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-10-13 17:49:01,597 INFO L443 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-10-13 17:49:01,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,610 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,612 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,612 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,613 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,613 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,614 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,614 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,614 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,615 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,616 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,617 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,618 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,622 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,622 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,622 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,623 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,626 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,627 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:49:01 BoogieIcfgContainer [2019-10-13 17:49:01,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 17:49:01,631 INFO L168 Benchmark]: Toolchain (without parser) took 14609.40 ms. Allocated memory was 145.2 MB in the beginning and 330.8 MB in the end (delta: 185.6 MB). Free memory was 103.3 MB in the beginning and 96.6 MB in the end (delta: 6.7 MB). Peak memory consumption was 192.3 MB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,632 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.17 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,633 INFO L168 Benchmark]: Boogie Preprocessor took 149.74 ms. Allocated memory was 145.2 MB in the beginning and 199.2 MB in the end (delta: 54.0 MB). Free memory was 92.9 MB in the beginning and 176.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,634 INFO L168 Benchmark]: RCFGBuilder took 349.54 ms. Allocated memory is still 199.2 MB. Free memory was 176.9 MB in the beginning and 160.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,635 INFO L168 Benchmark]: TraceAbstraction took 13736.06 ms. Allocated memory was 199.2 MB in the beginning and 330.8 MB in the end (delta: 131.6 MB). Free memory was 160.3 MB in the beginning and 96.6 MB in the end (delta: 63.7 MB). Peak memory consumption was 195.3 MB. Max. memory is 7.1 GB. [2019-10-13 17:49:01,638 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.58 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 360.17 ms. Allocated memory is still 145.2 MB. Free memory was 103.1 MB in the beginning and 92.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.74 ms. Allocated memory was 145.2 MB in the beginning and 199.2 MB in the end (delta: 54.0 MB). Free memory was 92.9 MB in the beginning and 176.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.54 ms. Allocated memory is still 199.2 MB. Free memory was 176.9 MB in the beginning and 160.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13736.06 ms. Allocated memory was 199.2 MB in the beginning and 330.8 MB in the end (delta: 131.6 MB). Free memory was 160.3 MB in the beginning and 96.6 MB in the end (delta: 63.7 MB). Peak memory consumption was 195.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2019-10-13 17:49:01,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,652 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,652 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,653 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,656 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((\exists v_init_~i~0_27 : int :: (v_init_~i~0_27 < 100000 && !(#memory_$Pointer$[a][v_init_~i~0_27 * 4 + a] == 0)) && 99999 <= v_init_~i~0_27) && flag == 0) && i == 0) && a == 0) || flag == 1) || ((((((\exists v_init_~i~0_27 : int :: (v_init_~i~0_27 < 100000 && !(#memory_$Pointer$[a][v_init_~i~0_27 * 4 + a] == 0)) && 99999 <= v_init_~i~0_27) && 0 == #memory_$Pointer$[a][a]) && i <= 99999) && flag == 0) && #memory_$Pointer$[a][a] == 0) && a == 0) - InvariantResult [Line: 12]: Loop Invariant [2019-10-13 17:49:01,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-13 17:49:01,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 17:49:01,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 17:49:01,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-13 17:49:01,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 17:49:01,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((a == a && \old(size) == size) && a == a) && (\exists v_init_~i~0_27 : int :: (!(0 == #memory_$Pointer$[a][a + v_init_~i~0_27 * 4]) && v_init_~i~0_27 < size) && i <= v_init_~i~0_27 + 1)) || (((((((\valid == \old(\valid) && i <= 0) && a == a) && \old(size) == size) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#length-unknown) == unknown-#length-unknown) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Result: SAFE, OverallTime: 13.6s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 343 SDtfs, 374 SDslu, 1720 SDs, 0 SdLazy, 1896 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 44 NumberOfFragments, 186 HoareAnnotationTreeSize, 27 FomulaSimplifications, 620 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 885 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 862 ConstructedInterpolants, 14 QuantifiedInterpolants, 174159 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 446/913 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...