java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 11:10:29,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 11:10:29,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 11:10:29,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 11:10:29,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 11:10:29,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 11:10:29,831 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 11:10:29,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 11:10:29,834 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 11:10:29,835 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 11:10:29,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 11:10:29,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 11:10:29,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 11:10:29,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 11:10:29,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 11:10:29,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 11:10:29,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 11:10:29,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 11:10:29,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 11:10:29,845 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 11:10:29,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 11:10:29,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 11:10:29,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 11:10:29,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 11:10:29,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 11:10:29,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 11:10:29,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 11:10:29,851 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 11:10:29,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 11:10:29,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 11:10:29,851 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 11:10:29,852 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf [2018-02-02 11:10:29,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 11:10:29,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 11:10:29,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 11:10:29,863 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 11:10:29,863 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 11:10:29,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 11:10:29,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 11:10:29,863 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 11:10:29,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 11:10:29,865 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 11:10:29,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 11:10:29,865 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 11:10:29,865 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 11:10:29,865 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 11:10:29,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 11:10:29,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 11:10:29,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-02-02 11:10:29,866 INFO L133 SettingsManager]: * SMT solver=External_Z3InterpolationMode [2018-02-02 11:10:29,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:29,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 11:10:29,909 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 11:10:29,912 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 11:10:29,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 11:10:29,914 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 11:10:29,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-02-02 11:10:30,019 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 11:10:30,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 11:10:30,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 11:10:30,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 11:10:30,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 11:10:30,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4412fd88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30, skipping insertion in model container [2018-02-02 11:10:30,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:10:30,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 11:10:30,146 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:10:30,157 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 11:10:30,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30 WrapperNode [2018-02-02 11:10:30,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 11:10:30,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 11:10:30,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 11:10:30,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 11:10:30,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... [2018-02-02 11:10:30,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 11:10:30,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 11:10:30,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 11:10:30,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 11:10:30,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 11:10:30,220 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 11:10:30,220 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 11:10:30,220 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 11:10:30,220 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 11:10:30,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 11:10:30,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 11:10:30,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 11:10:30,221 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 11:10:30,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 11:10:30,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 11:10:30,309 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 11:10:30,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:10:30 BoogieIcfgContainer [2018-02-02 11:10:30,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 11:10:30,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 11:10:30,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 11:10:30,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 11:10:30,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 11:10:30" (1/3) ... [2018-02-02 11:10:30,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6815c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:10:30, skipping insertion in model container [2018-02-02 11:10:30,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 11:10:30" (2/3) ... [2018-02-02 11:10:30,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6815c5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 11:10:30, skipping insertion in model container [2018-02-02 11:10:30,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 11:10:30" (3/3) ... [2018-02-02 11:10:30,315 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-02-02 11:10:30,321 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 11:10:30,326 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-02-02 11:10:30,357 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 11:10:30,358 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 11:10:30,358 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-02-02 11:10:30,358 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 11:10:30,358 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 11:10:30,358 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 11:10:30,358 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 11:10:30,358 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 11:10:30,359 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 11:10:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-02 11:10:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 11:10:30,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:30,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:30,381 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1213833872, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:30,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 11:10:30,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 11:10:30,501 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,501 INFO L182 omatonBuilderFactory]: Interpolants [34#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 30#true, 31#false] [2018-02-02 11:10:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 11:10:30,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 11:10:30,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 11:10:30,515 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-02-02 11:10:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:30,594 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-02-02 11:10:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 11:10:30,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-02 11:10:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:30,601 INFO L225 Difference]: With dead ends: 32 [2018-02-02 11:10:30,601 INFO L226 Difference]: Without dead ends: 22 [2018-02-02 11:10:30,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 11:10:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-02-02 11:10:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-02-02 11:10:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-02-02 11:10:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-02-02 11:10:30,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 8 [2018-02-02 11:10:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:30,622 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-02-02 11:10:30,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 11:10:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-02-02 11:10:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 11:10:30,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:30,622 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:30,622 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1723583497, now seen corresponding path program 1 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:30,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:30,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-02-02 11:10:30,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,665 INFO L182 omatonBuilderFactory]: Interpolants [89#true, 90#false, 93#(= main_~i~0 0), 94#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 11:10:30,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 11:10:30,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 11:10:30,667 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2018-02-02 11:10:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:30,696 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-02 11:10:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 11:10:30,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 11:10:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:30,697 INFO L225 Difference]: With dead ends: 31 [2018-02-02 11:10:30,697 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 11:10:30,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 11:10:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 11:10:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 11:10:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 11:10:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 11:10:30,701 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 12 [2018-02-02 11:10:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:30,701 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 11:10:30,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 11:10:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 11:10:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 11:10:30,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:30,702 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:30,702 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash -863334142, now seen corresponding path program 2 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:30,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:30,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 11:10:30,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,751 INFO L182 omatonBuilderFactory]: Interpolants [161#(= main_~i~0 0), 162#(= main_~i~0 1), 163#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 157#true, 158#false] [2018-02-02 11:10:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 11:10:30,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 11:10:30,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 11:10:30,752 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-02-02 11:10:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:30,809 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-02-02 11:10:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 11:10:30,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 11:10:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:30,810 INFO L225 Difference]: With dead ends: 40 [2018-02-02 11:10:30,810 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 11:10:30,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 11:10:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 11:10:30,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 11:10:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 11:10:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-02 11:10:30,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 16 [2018-02-02 11:10:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:30,815 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-02 11:10:30,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 11:10:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-02 11:10:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 11:10:30,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:30,815 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:30,816 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1930178939, now seen corresponding path program 3 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:30,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:30,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 11:10:30,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,887 INFO L182 omatonBuilderFactory]: Interpolants [244#true, 245#false, 248#(= main_~i~0 0), 249#(= main_~i~0 1), 250#(= main_~i~0 2), 251#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:30,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 11:10:30,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 11:10:30,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 11:10:30,888 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 6 states. [2018-02-02 11:10:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:30,979 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-02 11:10:30,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 11:10:30,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 11:10:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:30,980 INFO L225 Difference]: With dead ends: 49 [2018-02-02 11:10:30,980 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 11:10:30,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 11:10:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 11:10:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 11:10:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 11:10:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 11:10:30,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 20 [2018-02-02 11:10:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:30,985 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 11:10:30,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 11:10:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 11:10:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 11:10:30,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:30,986 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:30,986 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash -966333068, now seen corresponding path program 4 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:30,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:31,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 11:10:31,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,049 INFO L182 omatonBuilderFactory]: Interpolants [354#(= main_~i~0 0), 355#(= main_~i~0 1), 356#(= main_~i~0 2), 357#(= main_~i~0 3), 358#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 350#true, 351#false] [2018-02-02 11:10:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 11:10:31,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 11:10:31,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:10:31,049 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 7 states. [2018-02-02 11:10:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:31,140 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-02-02 11:10:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 11:10:31,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 11:10:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:31,141 INFO L225 Difference]: With dead ends: 58 [2018-02-02 11:10:31,141 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 11:10:31,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 11:10:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 11:10:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 11:10:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 11:10:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-02-02 11:10:31,146 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 24 [2018-02-02 11:10:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:31,146 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-02-02 11:10:31,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 11:10:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-02-02 11:10:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 11:10:31,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:31,147 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:31,147 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 899745005, now seen corresponding path program 5 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:31,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:31,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 11:10:31,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,214 INFO L182 omatonBuilderFactory]: Interpolants [480#(= main_~i~0 1), 481#(= main_~i~0 2), 482#(= main_~i~0 3), 483#(= main_~i~0 4), 484#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 475#true, 476#false, 479#(= main_~i~0 0)] [2018-02-02 11:10:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 11:10:31,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 11:10:31,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 11:10:31,214 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 8 states. [2018-02-02 11:10:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:31,313 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-02 11:10:31,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 11:10:31,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 11:10:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:31,314 INFO L225 Difference]: With dead ends: 67 [2018-02-02 11:10:31,314 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 11:10:31,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 11:10:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 11:10:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 11:10:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 11:10:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-02-02 11:10:31,319 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 28 [2018-02-02 11:10:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:31,320 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-02-02 11:10:31,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 11:10:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-02-02 11:10:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 11:10:31,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:31,321 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:31,321 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1029654554, now seen corresponding path program 6 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:31,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:31,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 11:10:31,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,385 INFO L182 omatonBuilderFactory]: Interpolants [624#(= main_~i~0 1), 625#(= main_~i~0 2), 626#(= main_~i~0 3), 627#(= main_~i~0 4), 628#(= main_~i~0 5), 629#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 619#true, 620#false, 623#(= main_~i~0 0)] [2018-02-02 11:10:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 11:10:31,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 11:10:31,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:10:31,386 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 9 states. [2018-02-02 11:10:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:31,556 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-02-02 11:10:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 11:10:31,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 11:10:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:31,557 INFO L225 Difference]: With dead ends: 76 [2018-02-02 11:10:31,557 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 11:10:31,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 11:10:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 11:10:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 11:10:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 11:10:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-02 11:10:31,561 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 32 [2018-02-02 11:10:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:31,561 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-02 11:10:31,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 11:10:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-02 11:10:31,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 11:10:31,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:31,562 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:31,562 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:31,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1842592161, now seen corresponding path program 7 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:31,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:31,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 11:10:31,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,626 INFO L182 omatonBuilderFactory]: Interpolants [786#(= main_~i~0 0), 787#(= main_~i~0 1), 788#(= main_~i~0 2), 789#(= main_~i~0 3), 790#(= main_~i~0 4), 791#(= main_~i~0 5), 792#(= main_~i~0 6), 793#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 782#true, 783#false] [2018-02-02 11:10:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 11:10:31,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 11:10:31,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:10:31,627 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 10 states. [2018-02-02 11:10:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:31,746 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-02-02 11:10:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 11:10:31,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 11:10:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:31,747 INFO L225 Difference]: With dead ends: 85 [2018-02-02 11:10:31,747 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 11:10:31,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 11:10:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 11:10:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 11:10:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 11:10:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-02 11:10:31,751 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 36 [2018-02-02 11:10:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:31,751 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-02 11:10:31,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 11:10:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-02 11:10:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 11:10:31,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:31,752 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:31,752 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2078928984, now seen corresponding path program 8 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:31,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:31,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 11:10:31,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,845 INFO L182 omatonBuilderFactory]: Interpolants [976#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 964#true, 965#false, 968#(= main_~i~0 0), 969#(= main_~i~0 1), 970#(= main_~i~0 2), 971#(= main_~i~0 3), 972#(= main_~i~0 4), 973#(= main_~i~0 5), 974#(= main_~i~0 6), 975#(= main_~i~0 7)] [2018-02-02 11:10:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:31,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 11:10:31,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 11:10:31,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:10:31,846 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 11 states. [2018-02-02 11:10:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:32,001 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-02-02 11:10:32,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 11:10:32,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-02-02 11:10:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:32,002 INFO L225 Difference]: With dead ends: 94 [2018-02-02 11:10:32,002 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 11:10:32,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 11:10:32,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 11:10:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 11:10:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 11:10:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-02-02 11:10:32,007 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 40 [2018-02-02 11:10:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:32,008 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-02-02 11:10:32,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 11:10:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-02-02 11:10:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 11:10:32,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:32,008 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:32,008 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1704987183, now seen corresponding path program 9 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:32,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:32,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 11:10:32,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,076 INFO L182 omatonBuilderFactory]: Interpolants [1169#(= main_~i~0 0), 1170#(= main_~i~0 1), 1171#(= main_~i~0 2), 1172#(= main_~i~0 3), 1173#(= main_~i~0 4), 1174#(= main_~i~0 5), 1175#(= main_~i~0 6), 1176#(= main_~i~0 7), 1177#(= main_~i~0 8), 1178#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1165#true, 1166#false] [2018-02-02 11:10:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 11:10:32,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 11:10:32,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 11:10:32,077 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 12 states. [2018-02-02 11:10:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:32,243 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-02-02 11:10:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 11:10:32,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-02-02 11:10:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:32,243 INFO L225 Difference]: With dead ends: 103 [2018-02-02 11:10:32,244 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 11:10:32,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 11:10:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 11:10:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-02 11:10:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 11:10:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-02-02 11:10:32,247 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 44 [2018-02-02 11:10:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:32,247 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-02-02 11:10:32,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 11:10:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-02-02 11:10:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 11:10:32,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:32,248 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:32,248 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -621504822, now seen corresponding path program 10 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:32,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:32,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 11:10:32,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,323 INFO L182 omatonBuilderFactory]: Interpolants [1385#true, 1386#false, 1389#(= main_~i~0 0), 1390#(= main_~i~0 1), 1391#(= main_~i~0 2), 1392#(= main_~i~0 3), 1393#(= main_~i~0 4), 1394#(= main_~i~0 5), 1395#(= main_~i~0 6), 1396#(= main_~i~0 7), 1397#(= main_~i~0 8), 1398#(= main_~i~0 9), 1399#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 11:10:32,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 11:10:32,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:10:32,324 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 13 states. [2018-02-02 11:10:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:32,613 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-02-02 11:10:32,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 11:10:32,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 11:10:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:32,614 INFO L225 Difference]: With dead ends: 112 [2018-02-02 11:10:32,614 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 11:10:32,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 11:10:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 11:10:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 11:10:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 11:10:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-02-02 11:10:32,619 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 48 [2018-02-02 11:10:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:32,619 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-02-02 11:10:32,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 11:10:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-02-02 11:10:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 11:10:32,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:32,620 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:32,620 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1913777341, now seen corresponding path program 11 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:32,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:32,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 11:10:32,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,740 INFO L182 omatonBuilderFactory]: Interpolants [1632#(= main_~i~0 4), 1633#(= main_~i~0 5), 1634#(= main_~i~0 6), 1635#(= main_~i~0 7), 1636#(= main_~i~0 8), 1637#(= main_~i~0 9), 1638#(= main_~i~0 10), 1639#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1624#true, 1625#false, 1628#(= main_~i~0 0), 1629#(= main_~i~0 1), 1630#(= main_~i~0 2), 1631#(= main_~i~0 3)] [2018-02-02 11:10:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:32,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 11:10:32,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 11:10:32,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 11:10:32,741 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 14 states. [2018-02-02 11:10:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:33,023 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-02-02 11:10:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 11:10:33,023 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 11:10:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:33,024 INFO L225 Difference]: With dead ends: 121 [2018-02-02 11:10:33,024 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 11:10:33,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-02 11:10:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 11:10:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 11:10:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 11:10:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-02-02 11:10:33,029 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 52 [2018-02-02 11:10:33,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:33,029 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-02-02 11:10:33,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 11:10:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-02-02 11:10:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 11:10:33,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:33,030 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:33,030 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -160257220, now seen corresponding path program 12 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-02 11:10:33,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:33,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 11:10:33,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,126 INFO L182 omatonBuilderFactory]: Interpolants [1888#(= main_~i~0 2), 1889#(= main_~i~0 3), 1890#(= main_~i~0 4), 1891#(= main_~i~0 5), 1892#(= main_~i~0 6), 1893#(= main_~i~0 7), 1894#(= main_~i~0 8), 1895#(= main_~i~0 9), 1896#(= main_~i~0 10), 1897#(= main_~i~0 11), 1898#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 1882#true, 1883#false, 1886#(= main_~i~0 0), 1887#(= main_~i~0 1)] [2018-02-02 11:10:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 11:10:33,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 11:10:33,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:10:33,127 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 15 states. [2018-02-02 11:10:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:33,420 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2018-02-02 11:10:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 11:10:33,420 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-02 11:10:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:33,421 INFO L225 Difference]: With dead ends: 130 [2018-02-02 11:10:33,421 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 11:10:33,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 11:10:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 11:10:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-02-02 11:10:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 11:10:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-02-02 11:10:33,425 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 56 [2018-02-02 11:10:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:33,425 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-02-02 11:10:33,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 11:10:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-02-02 11:10:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 11:10:33,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:33,426 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:33,426 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -628580683, now seen corresponding path program 13 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:33,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:33,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 11:10:33,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,520 INFO L182 omatonBuilderFactory]: Interpolants [2176#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2159#true, 2160#false, 2163#(= main_~i~0 0), 2164#(= main_~i~0 1), 2165#(= main_~i~0 2), 2166#(= main_~i~0 3), 2167#(= main_~i~0 4), 2168#(= main_~i~0 5), 2169#(= main_~i~0 6), 2170#(= main_~i~0 7), 2171#(= main_~i~0 8), 2172#(= main_~i~0 9), 2173#(= main_~i~0 10), 2174#(= main_~i~0 11), 2175#(= main_~i~0 12)] [2018-02-02 11:10:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 11:10:33,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 11:10:33,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 11:10:33,521 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 16 states. [2018-02-02 11:10:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:33,808 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-02-02 11:10:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 11:10:33,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-02 11:10:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:33,809 INFO L225 Difference]: With dead ends: 139 [2018-02-02 11:10:33,809 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 11:10:33,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 11:10:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 11:10:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 11:10:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 11:10:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-02-02 11:10:33,812 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 60 [2018-02-02 11:10:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:33,812 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-02-02 11:10:33,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 11:10:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-02-02 11:10:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 11:10:33,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:33,813 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:33,813 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash 320220590, now seen corresponding path program 14 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:33,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:33,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 11:10:33,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,915 INFO L182 omatonBuilderFactory]: Interpolants [2464#(= main_~i~0 5), 2465#(= main_~i~0 6), 2466#(= main_~i~0 7), 2467#(= main_~i~0 8), 2468#(= main_~i~0 9), 2469#(= main_~i~0 10), 2470#(= main_~i~0 11), 2471#(= main_~i~0 12), 2472#(= main_~i~0 13), 2473#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2455#true, 2456#false, 2459#(= main_~i~0 0), 2460#(= main_~i~0 1), 2461#(= main_~i~0 2), 2462#(= main_~i~0 3), 2463#(= main_~i~0 4)] [2018-02-02 11:10:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:33,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 11:10:33,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 11:10:33,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 11:10:33,916 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 17 states. [2018-02-02 11:10:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:34,247 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2018-02-02 11:10:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 11:10:34,247 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-02-02 11:10:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:34,248 INFO L225 Difference]: With dead ends: 148 [2018-02-02 11:10:34,248 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 11:10:34,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 11:10:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 11:10:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 11:10:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 11:10:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-02-02 11:10:34,251 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 64 [2018-02-02 11:10:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:34,251 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-02-02 11:10:34,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 11:10:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-02-02 11:10:34,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 11:10:34,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:34,252 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:34,252 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 467769383, now seen corresponding path program 15 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:34,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:34,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 11:10:34,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,416 INFO L182 omatonBuilderFactory]: Interpolants [2784#(= main_~i~0 10), 2785#(= main_~i~0 11), 2786#(= main_~i~0 12), 2787#(= main_~i~0 13), 2788#(= main_~i~0 14), 2789#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 2770#true, 2771#false, 2774#(= main_~i~0 0), 2775#(= main_~i~0 1), 2776#(= main_~i~0 2), 2777#(= main_~i~0 3), 2778#(= main_~i~0 4), 2779#(= main_~i~0 5), 2780#(= main_~i~0 6), 2781#(= main_~i~0 7), 2782#(= main_~i~0 8), 2783#(= main_~i~0 9)] [2018-02-02 11:10:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 11:10:34,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 11:10:34,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 11:10:34,417 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 18 states. [2018-02-02 11:10:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:34,812 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-02-02 11:10:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 11:10:34,812 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-02-02 11:10:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:34,813 INFO L225 Difference]: With dead ends: 157 [2018-02-02 11:10:34,813 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 11:10:34,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 11:10:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 11:10:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-02-02 11:10:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 11:10:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-02-02 11:10:34,816 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 68 [2018-02-02 11:10:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:34,818 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-02-02 11:10:34,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 11:10:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-02-02 11:10:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 11:10:34,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:34,818 INFO L351 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:34,818 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770656, now seen corresponding path program 16 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:34,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:34,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 11:10:34,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,931 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3108#(= main_~i~0 0), 3109#(= main_~i~0 1), 3110#(= main_~i~0 2), 3111#(= main_~i~0 3), 3112#(= main_~i~0 4), 3113#(= main_~i~0 5), 3114#(= main_~i~0 6), 3115#(= main_~i~0 7), 3116#(= main_~i~0 8), 3117#(= main_~i~0 9), 3118#(= main_~i~0 10), 3119#(= main_~i~0 11), 3120#(= main_~i~0 12), 3121#(= main_~i~0 13), 3122#(= main_~i~0 14), 3123#(= main_~i~0 15), 3124#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:34,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 11:10:34,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 11:10:34,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 11:10:34,932 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 19 states. [2018-02-02 11:10:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:35,349 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2018-02-02 11:10:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 11:10:35,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-02-02 11:10:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:35,350 INFO L225 Difference]: With dead ends: 166 [2018-02-02 11:10:35,350 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 11:10:35,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 11:10:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 11:10:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 11:10:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 11:10:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-02-02 11:10:35,353 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 72 [2018-02-02 11:10:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:35,354 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-02-02 11:10:35,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 11:10:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-02-02 11:10:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 11:10:35,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:35,354 INFO L351 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:35,355 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash 464191385, now seen corresponding path program 17 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:35,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:35,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:35,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 11:10:35,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:35,506 INFO L182 omatonBuilderFactory]: Interpolants [3457#true, 3458#false, 3461#(= main_~i~0 0), 3462#(= main_~i~0 1), 3463#(= main_~i~0 2), 3464#(= main_~i~0 3), 3465#(= main_~i~0 4), 3466#(= main_~i~0 5), 3467#(= main_~i~0 6), 3468#(= main_~i~0 7), 3469#(= main_~i~0 8), 3470#(= main_~i~0 9), 3471#(= main_~i~0 10), 3472#(= main_~i~0 11), 3473#(= main_~i~0 12), 3474#(= main_~i~0 13), 3475#(= main_~i~0 14), 3476#(= main_~i~0 15), 3477#(= main_~i~0 16), 3478#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:35,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 11:10:35,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 11:10:35,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 11:10:35,507 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 20 states. [2018-02-02 11:10:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:35,999 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-02-02 11:10:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 11:10:35,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2018-02-02 11:10:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:36,000 INFO L225 Difference]: With dead ends: 175 [2018-02-02 11:10:36,000 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 11:10:36,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 11:10:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 11:10:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-02 11:10:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 11:10:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-02-02 11:10:36,002 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 76 [2018-02-02 11:10:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:36,002 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-02-02 11:10:36,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 11:10:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-02-02 11:10:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 11:10:36,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:36,003 INFO L351 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:36,003 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1217756306, now seen corresponding path program 18 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:36,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:36,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 11:10:36,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,134 INFO L182 omatonBuilderFactory]: Interpolants [3840#(= main_~i~0 7), 3841#(= main_~i~0 8), 3842#(= main_~i~0 9), 3843#(= main_~i~0 10), 3844#(= main_~i~0 11), 3845#(= main_~i~0 12), 3846#(= main_~i~0 13), 3847#(= main_~i~0 14), 3848#(= main_~i~0 15), 3849#(= main_~i~0 16), 3850#(= main_~i~0 17), 3851#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 3829#true, 3830#false, 3833#(= main_~i~0 0), 3834#(= main_~i~0 1), 3835#(= main_~i~0 2), 3836#(= main_~i~0 3), 3837#(= main_~i~0 4), 3838#(= main_~i~0 5), 3839#(= main_~i~0 6)] [2018-02-02 11:10:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 11:10:36,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 11:10:36,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-02 11:10:36,135 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 21 states. [2018-02-02 11:10:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:36,674 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2018-02-02 11:10:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 11:10:36,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-02-02 11:10:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:36,675 INFO L225 Difference]: With dead ends: 184 [2018-02-02 11:10:36,675 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 11:10:36,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-02 11:10:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 11:10:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-02-02 11:10:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 11:10:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-02-02 11:10:36,679 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 80 [2018-02-02 11:10:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:36,679 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-02-02 11:10:36,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 11:10:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-02-02 11:10:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 11:10:36,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:36,680 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:36,680 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -778644213, now seen corresponding path program 19 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:36,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:36,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 11:10:36,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,816 INFO L182 omatonBuilderFactory]: Interpolants [4224#(= main_~i~0 0), 4225#(= main_~i~0 1), 4226#(= main_~i~0 2), 4227#(= main_~i~0 3), 4228#(= main_~i~0 4), 4229#(= main_~i~0 5), 4230#(= main_~i~0 6), 4231#(= main_~i~0 7), 4232#(= main_~i~0 8), 4233#(= main_~i~0 9), 4234#(= main_~i~0 10), 4235#(= main_~i~0 11), 4236#(= main_~i~0 12), 4237#(= main_~i~0 13), 4238#(= main_~i~0 14), 4239#(= main_~i~0 15), 4240#(= main_~i~0 16), 4241#(= main_~i~0 17), 4242#(= main_~i~0 18), 4243#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 4220#true, 4221#false] [2018-02-02 11:10:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:36,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 11:10:36,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 11:10:36,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 11:10:36,817 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 22 states. [2018-02-02 11:10:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:37,415 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-02-02 11:10:37,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 11:10:37,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-02-02 11:10:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:37,416 INFO L225 Difference]: With dead ends: 193 [2018-02-02 11:10:37,416 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 11:10:37,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 11:10:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 11:10:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-02 11:10:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 11:10:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-02-02 11:10:37,419 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 84 [2018-02-02 11:10:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:37,419 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-02-02 11:10:37,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 11:10:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-02-02 11:10:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 11:10:37,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:37,420 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:37,420 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -791328508, now seen corresponding path program 20 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:37,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:37,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:37,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 11:10:37,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:37,565 INFO L182 omatonBuilderFactory]: Interpolants [4640#(= main_~i~0 6), 4641#(= main_~i~0 7), 4642#(= main_~i~0 8), 4643#(= main_~i~0 9), 4644#(= main_~i~0 10), 4645#(= main_~i~0 11), 4646#(= main_~i~0 12), 4647#(= main_~i~0 13), 4648#(= main_~i~0 14), 4649#(= main_~i~0 15), 4650#(= main_~i~0 16), 4651#(= main_~i~0 17), 4652#(= main_~i~0 18), 4653#(= main_~i~0 19), 4654#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 4630#true, 4631#false, 4634#(= main_~i~0 0), 4635#(= main_~i~0 1), 4636#(= main_~i~0 2), 4637#(= main_~i~0 3), 4638#(= main_~i~0 4), 4639#(= main_~i~0 5)] [2018-02-02 11:10:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:37,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 11:10:37,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 11:10:37,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-02 11:10:37,566 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 23 states. [2018-02-02 11:10:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:38,226 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-02-02 11:10:38,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 11:10:38,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 88 [2018-02-02 11:10:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:38,226 INFO L225 Difference]: With dead ends: 202 [2018-02-02 11:10:38,226 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 11:10:38,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-02 11:10:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 11:10:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-02-02 11:10:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 11:10:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-02-02 11:10:38,229 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 88 [2018-02-02 11:10:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:38,230 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-02-02 11:10:38,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 11:10:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-02-02 11:10:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 11:10:38,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:38,230 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:38,231 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1666652285, now seen corresponding path program 21 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:38,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:38,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:38,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 11:10:38,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:38,392 INFO L182 omatonBuilderFactory]: Interpolants [5059#true, 5060#false, 5063#(= main_~i~0 0), 5064#(= main_~i~0 1), 5065#(= main_~i~0 2), 5066#(= main_~i~0 3), 5067#(= main_~i~0 4), 5068#(= main_~i~0 5), 5069#(= main_~i~0 6), 5070#(= main_~i~0 7), 5071#(= main_~i~0 8), 5072#(= main_~i~0 9), 5073#(= main_~i~0 10), 5074#(= main_~i~0 11), 5075#(= main_~i~0 12), 5076#(= main_~i~0 13), 5077#(= main_~i~0 14), 5078#(= main_~i~0 15), 5079#(= main_~i~0 16), 5080#(= main_~i~0 17), 5081#(= main_~i~0 18), 5082#(= main_~i~0 19), 5083#(= main_~i~0 20), 5084#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:38,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 11:10:38,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 11:10:38,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-02 11:10:38,393 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 24 states. [2018-02-02 11:10:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:39,119 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-02-02 11:10:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 11:10:39,120 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 92 [2018-02-02 11:10:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:39,120 INFO L225 Difference]: With dead ends: 211 [2018-02-02 11:10:39,120 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 11:10:39,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-02 11:10:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 11:10:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-02-02 11:10:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 11:10:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-02-02 11:10:39,123 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 92 [2018-02-02 11:10:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:39,123 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-02-02 11:10:39,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 11:10:39,123 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-02-02 11:10:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 11:10:39,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:39,124 INFO L351 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:39,124 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:39,124 INFO L82 PathProgramCache]: Analyzing trace with hash 956466038, now seen corresponding path program 22 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:39,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:39,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:39,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 11:10:39,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:39,346 INFO L182 omatonBuilderFactory]: Interpolants [5507#true, 5508#false, 5511#(= main_~i~0 0), 5512#(= main_~i~0 1), 5513#(= main_~i~0 2), 5514#(= main_~i~0 3), 5515#(= main_~i~0 4), 5516#(= main_~i~0 5), 5517#(= main_~i~0 6), 5518#(= main_~i~0 7), 5519#(= main_~i~0 8), 5520#(= main_~i~0 9), 5521#(= main_~i~0 10), 5522#(= main_~i~0 11), 5523#(= main_~i~0 12), 5524#(= main_~i~0 13), 5525#(= main_~i~0 14), 5526#(= main_~i~0 15), 5527#(= main_~i~0 16), 5528#(= main_~i~0 17), 5529#(= main_~i~0 18), 5530#(= main_~i~0 19), 5531#(= main_~i~0 20), 5532#(= main_~i~0 21), 5533#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:39,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 11:10:39,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 11:10:39,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 11:10:39,348 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 25 states. [2018-02-02 11:10:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:40,139 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2018-02-02 11:10:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 11:10:40,139 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2018-02-02 11:10:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:40,140 INFO L225 Difference]: With dead ends: 220 [2018-02-02 11:10:40,140 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 11:10:40,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 11:10:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 11:10:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 11:10:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 11:10:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-02-02 11:10:40,144 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 96 [2018-02-02 11:10:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:40,144 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-02-02 11:10:40,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 11:10:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-02-02 11:10:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 11:10:40,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:40,144 INFO L351 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:40,144 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash 614320623, now seen corresponding path program 23 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:40,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:40,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:40,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 11:10:40,340 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:40,340 INFO L182 omatonBuilderFactory]: Interpolants [5974#true, 5975#false, 5978#(= main_~i~0 0), 5979#(= main_~i~0 1), 5980#(= main_~i~0 2), 5981#(= main_~i~0 3), 5982#(= main_~i~0 4), 5983#(= main_~i~0 5), 5984#(= main_~i~0 6), 5985#(= main_~i~0 7), 5986#(= main_~i~0 8), 5987#(= main_~i~0 9), 5988#(= main_~i~0 10), 5989#(= main_~i~0 11), 5990#(= main_~i~0 12), 5991#(= main_~i~0 13), 5992#(= main_~i~0 14), 5993#(= main_~i~0 15), 5994#(= main_~i~0 16), 5995#(= main_~i~0 17), 5996#(= main_~i~0 18), 5997#(= main_~i~0 19), 5998#(= main_~i~0 20), 5999#(= main_~i~0 21), 6000#(= main_~i~0 22), 6001#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:40,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 11:10:40,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 11:10:40,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 11:10:40,341 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 26 states. [2018-02-02 11:10:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:41,135 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-02-02 11:10:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 11:10:41,135 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 100 [2018-02-02 11:10:41,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:41,136 INFO L225 Difference]: With dead ends: 229 [2018-02-02 11:10:41,136 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 11:10:41,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 11:10:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 11:10:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-02-02 11:10:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 11:10:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-02-02 11:10:41,138 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 100 [2018-02-02 11:10:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:41,138 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-02-02 11:10:41,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 11:10:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-02-02 11:10:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-02 11:10:41,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:41,139 INFO L351 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:41,139 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1412486168, now seen corresponding path program 24 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:41,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:41,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:41,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 11:10:41,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:41,413 INFO L182 omatonBuilderFactory]: Interpolants [6464#(= main_~i~0 0), 6465#(= main_~i~0 1), 6466#(= main_~i~0 2), 6467#(= main_~i~0 3), 6468#(= main_~i~0 4), 6469#(= main_~i~0 5), 6470#(= main_~i~0 6), 6471#(= main_~i~0 7), 6472#(= main_~i~0 8), 6473#(= main_~i~0 9), 6474#(= main_~i~0 10), 6475#(= main_~i~0 11), 6476#(= main_~i~0 12), 6477#(= main_~i~0 13), 6478#(= main_~i~0 14), 6479#(= main_~i~0 15), 6480#(= main_~i~0 16), 6481#(= main_~i~0 17), 6482#(= main_~i~0 18), 6483#(= main_~i~0 19), 6484#(= main_~i~0 20), 6485#(= main_~i~0 21), 6486#(= main_~i~0 22), 6487#(= main_~i~0 23), 6488#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 6460#true, 6461#false] [2018-02-02 11:10:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:41,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 11:10:41,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 11:10:41,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-02 11:10:41,414 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 27 states. [2018-02-02 11:10:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:42,323 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2018-02-02 11:10:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 11:10:42,323 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2018-02-02 11:10:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:42,324 INFO L225 Difference]: With dead ends: 238 [2018-02-02 11:10:42,324 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 11:10:42,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-02-02 11:10:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 11:10:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-02 11:10:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 11:10:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-02-02 11:10:42,328 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 104 [2018-02-02 11:10:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:42,329 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-02-02 11:10:42,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 11:10:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-02-02 11:10:42,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 11:10:42,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:42,330 INFO L351 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:42,330 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1759712927, now seen corresponding path program 25 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:42,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:42,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:42,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 11:10:42,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:42,545 INFO L182 omatonBuilderFactory]: Interpolants [6976#(= main_~i~0 7), 6977#(= main_~i~0 8), 6978#(= main_~i~0 9), 6979#(= main_~i~0 10), 6980#(= main_~i~0 11), 6981#(= main_~i~0 12), 6982#(= main_~i~0 13), 6983#(= main_~i~0 14), 6984#(= main_~i~0 15), 6985#(= main_~i~0 16), 6986#(= main_~i~0 17), 6987#(= main_~i~0 18), 6988#(= main_~i~0 19), 6989#(= main_~i~0 20), 6990#(= main_~i~0 21), 6991#(= main_~i~0 22), 6992#(= main_~i~0 23), 6993#(= main_~i~0 24), 6994#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 6965#true, 6966#false, 6969#(= main_~i~0 0), 6970#(= main_~i~0 1), 6971#(= main_~i~0 2), 6972#(= main_~i~0 3), 6973#(= main_~i~0 4), 6974#(= main_~i~0 5), 6975#(= main_~i~0 6)] [2018-02-02 11:10:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:42,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 11:10:42,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 11:10:42,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-02 11:10:42,546 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 28 states. [2018-02-02 11:10:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:43,820 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-02-02 11:10:43,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 11:10:43,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2018-02-02 11:10:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:43,821 INFO L225 Difference]: With dead ends: 247 [2018-02-02 11:10:43,821 INFO L226 Difference]: Without dead ends: 247 [2018-02-02 11:10:43,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-02 11:10:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-02 11:10:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-02-02 11:10:43,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 11:10:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-02 11:10:43,825 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 108 [2018-02-02 11:10:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:43,825 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-02 11:10:43,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 11:10:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-02 11:10:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 11:10:43,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:43,826 INFO L351 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:43,826 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:43,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2115157414, now seen corresponding path program 26 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [2018-02-02 11:10:43,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:44,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:44,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 11:10:44,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:44,114 INFO L182 omatonBuilderFactory]: Interpolants [7489#true, 7490#false, 7493#(= main_~i~0 0), 7494#(= main_~i~0 1), 7495#(= main_~i~0 2), 7496#(= main_~i~0 3), 7497#(= main_~i~0 4), 7498#(= main_~i~0 5), 7499#(= main_~i~0 6), 7500#(= main_~i~0 7), 7501#(= main_~i~0 8), 7502#(= main_~i~0 9), 7503#(= main_~i~0 10), 7504#(= main_~i~0 11), 7505#(= main_~i~0 12), 7506#(= main_~i~0 13), 7507#(= main_~i~0 14), 7508#(= main_~i~0 15), 7509#(= main_~i~0 16), 7510#(= main_~i~0 17), 7511#(= main_~i~0 18), 7512#(= main_~i~0 19), 7513#(= main_~i~0 20), 7514#(= main_~i~0 21), 7515#(= main_~i~0 22), 7516#(= main_~i~0 23), 7517#(= main_~i~0 24), 7518#(= main_~i~0 25), 7519#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:44,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 11:10:44,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 11:10:44,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 11:10:44,115 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 29 states. [2018-02-02 11:10:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:45,167 INFO L93 Difference]: Finished difference Result 256 states and 257 transitions. [2018-02-02 11:10:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 11:10:45,167 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2018-02-02 11:10:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:45,168 INFO L225 Difference]: With dead ends: 256 [2018-02-02 11:10:45,168 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 11:10:45,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 11:10:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 11:10:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-02-02 11:10:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 11:10:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-02-02 11:10:45,172 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 112 [2018-02-02 11:10:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:45,173 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-02-02 11:10:45,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 11:10:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-02-02 11:10:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 11:10:45,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:45,174 INFO L351 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:45,174 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1787197139, now seen corresponding path program 27 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:45,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:45,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:45,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 11:10:45,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:45,422 INFO L182 omatonBuilderFactory]: Interpolants [8032#true, 8033#false, 8036#(= main_~i~0 0), 8037#(= main_~i~0 1), 8038#(= main_~i~0 2), 8039#(= main_~i~0 3), 8040#(= main_~i~0 4), 8041#(= main_~i~0 5), 8042#(= main_~i~0 6), 8043#(= main_~i~0 7), 8044#(= main_~i~0 8), 8045#(= main_~i~0 9), 8046#(= main_~i~0 10), 8047#(= main_~i~0 11), 8048#(= main_~i~0 12), 8049#(= main_~i~0 13), 8050#(= main_~i~0 14), 8051#(= main_~i~0 15), 8052#(= main_~i~0 16), 8053#(= main_~i~0 17), 8054#(= main_~i~0 18), 8055#(= main_~i~0 19), 8056#(= main_~i~0 20), 8057#(= main_~i~0 21), 8058#(= main_~i~0 22), 8059#(= main_~i~0 23), 8060#(= main_~i~0 24), 8061#(= main_~i~0 25), 8062#(= main_~i~0 26), 8063#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:45,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 11:10:45,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 11:10:45,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-02 11:10:45,423 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 30 states. [2018-02-02 11:10:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:46,548 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-02-02 11:10:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 11:10:46,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 116 [2018-02-02 11:10:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:46,549 INFO L225 Difference]: With dead ends: 265 [2018-02-02 11:10:46,549 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 11:10:46,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-02-02 11:10:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 11:10:46,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-02-02 11:10:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 11:10:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-02-02 11:10:46,551 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 116 [2018-02-02 11:10:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:46,552 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-02-02 11:10:46,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 11:10:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-02-02 11:10:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 11:10:46,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:46,552 INFO L351 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:46,552 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1108264652, now seen corresponding path program 28 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:46,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:46,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:46,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 11:10:46,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:46,813 INFO L182 omatonBuilderFactory]: Interpolants [8594#true, 8595#false, 8598#(= main_~i~0 0), 8599#(= main_~i~0 1), 8600#(= main_~i~0 2), 8601#(= main_~i~0 3), 8602#(= main_~i~0 4), 8603#(= main_~i~0 5), 8604#(= main_~i~0 6), 8605#(= main_~i~0 7), 8606#(= main_~i~0 8), 8607#(= main_~i~0 9), 8608#(= main_~i~0 10), 8609#(= main_~i~0 11), 8610#(= main_~i~0 12), 8611#(= main_~i~0 13), 8612#(= main_~i~0 14), 8613#(= main_~i~0 15), 8614#(= main_~i~0 16), 8615#(= main_~i~0 17), 8616#(= main_~i~0 18), 8617#(= main_~i~0 19), 8618#(= main_~i~0 20), 8619#(= main_~i~0 21), 8620#(= main_~i~0 22), 8621#(= main_~i~0 23), 8622#(= main_~i~0 24), 8623#(= main_~i~0 25), 8624#(= main_~i~0 26), 8625#(= main_~i~0 27), 8626#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:46,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 11:10:46,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 11:10:46,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-02 11:10:46,814 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 31 states. [2018-02-02 11:10:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:48,052 INFO L93 Difference]: Finished difference Result 274 states and 275 transitions. [2018-02-02 11:10:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 11:10:48,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 120 [2018-02-02 11:10:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:48,053 INFO L225 Difference]: With dead ends: 274 [2018-02-02 11:10:48,053 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 11:10:48,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-02 11:10:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 11:10:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-02-02 11:10:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 11:10:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-02-02 11:10:48,056 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 120 [2018-02-02 11:10:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:48,057 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-02-02 11:10:48,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 11:10:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-02-02 11:10:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-02-02 11:10:48,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:48,057 INFO L351 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:48,057 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2089579077, now seen corresponding path program 29 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:48,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:48,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:48,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 11:10:48,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:48,297 INFO L182 omatonBuilderFactory]: Interpolants [9175#true, 9176#false, 9179#(= main_~i~0 0), 9180#(= main_~i~0 1), 9181#(= main_~i~0 2), 9182#(= main_~i~0 3), 9183#(= main_~i~0 4), 9184#(= main_~i~0 5), 9185#(= main_~i~0 6), 9186#(= main_~i~0 7), 9187#(= main_~i~0 8), 9188#(= main_~i~0 9), 9189#(= main_~i~0 10), 9190#(= main_~i~0 11), 9191#(= main_~i~0 12), 9192#(= main_~i~0 13), 9193#(= main_~i~0 14), 9194#(= main_~i~0 15), 9195#(= main_~i~0 16), 9196#(= main_~i~0 17), 9197#(= main_~i~0 18), 9198#(= main_~i~0 19), 9199#(= main_~i~0 20), 9200#(= main_~i~0 21), 9201#(= main_~i~0 22), 9202#(= main_~i~0 23), 9203#(= main_~i~0 24), 9204#(= main_~i~0 25), 9205#(= main_~i~0 26), 9206#(= main_~i~0 27), 9207#(= main_~i~0 28), 9208#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:48,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 11:10:48,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 11:10:48,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-02 11:10:48,298 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 32 states. [2018-02-02 11:10:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:49,575 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-02-02 11:10:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 11:10:49,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 124 [2018-02-02 11:10:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:49,576 INFO L225 Difference]: With dead ends: 283 [2018-02-02 11:10:49,576 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 11:10:49,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-02-02 11:10:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 11:10:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-02 11:10:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 11:10:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-02-02 11:10:49,581 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 124 [2018-02-02 11:10:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:49,581 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-02-02 11:10:49,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 11:10:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-02-02 11:10:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-02 11:10:49,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:49,582 INFO L351 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:49,582 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1595557570, now seen corresponding path program 30 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:49,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:49,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:49,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 11:10:49,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:49,915 INFO L182 omatonBuilderFactory]: Interpolants [9792#(= main_~i~0 13), 9793#(= main_~i~0 14), 9794#(= main_~i~0 15), 9795#(= main_~i~0 16), 9796#(= main_~i~0 17), 9797#(= main_~i~0 18), 9798#(= main_~i~0 19), 9799#(= main_~i~0 20), 9800#(= main_~i~0 21), 9801#(= main_~i~0 22), 9802#(= main_~i~0 23), 9803#(= main_~i~0 24), 9804#(= main_~i~0 25), 9805#(= main_~i~0 26), 9806#(= main_~i~0 27), 9807#(= main_~i~0 28), 9808#(= main_~i~0 29), 9809#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 9775#true, 9776#false, 9779#(= main_~i~0 0), 9780#(= main_~i~0 1), 9781#(= main_~i~0 2), 9782#(= main_~i~0 3), 9783#(= main_~i~0 4), 9784#(= main_~i~0 5), 9785#(= main_~i~0 6), 9786#(= main_~i~0 7), 9787#(= main_~i~0 8), 9788#(= main_~i~0 9), 9789#(= main_~i~0 10), 9790#(= main_~i~0 11), 9791#(= main_~i~0 12)] [2018-02-02 11:10:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:49,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 11:10:49,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 11:10:49,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 11:10:49,917 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 33 states. [2018-02-02 11:10:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:51,326 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-02-02 11:10:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 11:10:51,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 128 [2018-02-02 11:10:51,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:51,327 INFO L225 Difference]: With dead ends: 292 [2018-02-02 11:10:51,327 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 11:10:51,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 11:10:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 11:10:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-02-02 11:10:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 11:10:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2018-02-02 11:10:51,331 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 128 [2018-02-02 11:10:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:51,331 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 293 transitions. [2018-02-02 11:10:51,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 11:10:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 293 transitions. [2018-02-02 11:10:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 11:10:51,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:51,332 INFO L351 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:51,332 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash -656352329, now seen corresponding path program 31 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:51,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:51,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:51,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 11:10:51,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:51,624 INFO L182 omatonBuilderFactory]: Interpolants [10394#true, 10395#false, 10398#(= main_~i~0 0), 10399#(= main_~i~0 1), 10400#(= main_~i~0 2), 10401#(= main_~i~0 3), 10402#(= main_~i~0 4), 10403#(= main_~i~0 5), 10404#(= main_~i~0 6), 10405#(= main_~i~0 7), 10406#(= main_~i~0 8), 10407#(= main_~i~0 9), 10408#(= main_~i~0 10), 10409#(= main_~i~0 11), 10410#(= main_~i~0 12), 10411#(= main_~i~0 13), 10412#(= main_~i~0 14), 10413#(= main_~i~0 15), 10414#(= main_~i~0 16), 10415#(= main_~i~0 17), 10416#(= main_~i~0 18), 10417#(= main_~i~0 19), 10418#(= main_~i~0 20), 10419#(= main_~i~0 21), 10420#(= main_~i~0 22), 10421#(= main_~i~0 23), 10422#(= main_~i~0 24), 10423#(= main_~i~0 25), 10424#(= main_~i~0 26), 10425#(= main_~i~0 27), 10426#(= main_~i~0 28), 10427#(= main_~i~0 29), 10428#(= main_~i~0 30), 10429#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:51,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 11:10:51,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 11:10:51,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 11:10:51,625 INFO L87 Difference]: Start difference. First operand 292 states and 293 transitions. Second operand 34 states. [2018-02-02 11:10:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:53,072 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-02-02 11:10:53,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 11:10:53,072 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-02-02 11:10:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:53,073 INFO L225 Difference]: With dead ends: 301 [2018-02-02 11:10:53,073 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 11:10:53,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 11:10:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 11:10:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-02-02 11:10:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 11:10:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-02-02 11:10:53,076 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 132 [2018-02-02 11:10:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:53,076 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-02-02 11:10:53,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 11:10:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-02-02 11:10:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-02-02 11:10:53,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:53,077 INFO L351 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:53,077 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:53,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2128340560, now seen corresponding path program 32 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:53,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:53,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:53,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 11:10:53,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:53,391 INFO L182 omatonBuilderFactory]: Interpolants [11032#true, 11033#false, 11036#(= main_~i~0 0), 11037#(= main_~i~0 1), 11038#(= main_~i~0 2), 11039#(= main_~i~0 3), 11040#(= main_~i~0 4), 11041#(= main_~i~0 5), 11042#(= main_~i~0 6), 11043#(= main_~i~0 7), 11044#(= main_~i~0 8), 11045#(= main_~i~0 9), 11046#(= main_~i~0 10), 11047#(= main_~i~0 11), 11048#(= main_~i~0 12), 11049#(= main_~i~0 13), 11050#(= main_~i~0 14), 11051#(= main_~i~0 15), 11052#(= main_~i~0 16), 11053#(= main_~i~0 17), 11054#(= main_~i~0 18), 11055#(= main_~i~0 19), 11056#(= main_~i~0 20), 11057#(= main_~i~0 21), 11058#(= main_~i~0 22), 11059#(= main_~i~0 23), 11060#(= main_~i~0 24), 11061#(= main_~i~0 25), 11062#(= main_~i~0 26), 11063#(= main_~i~0 27), 11064#(= main_~i~0 28), 11065#(= main_~i~0 29), 11066#(= main_~i~0 30), 11067#(= main_~i~0 31), 11068#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:53,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 11:10:53,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 11:10:53,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 11:10:53,393 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 35 states. [2018-02-02 11:10:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:54,965 INFO L93 Difference]: Finished difference Result 310 states and 311 transitions. [2018-02-02 11:10:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 11:10:54,965 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-02-02 11:10:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:54,966 INFO L225 Difference]: With dead ends: 310 [2018-02-02 11:10:54,966 INFO L226 Difference]: Without dead ends: 310 [2018-02-02 11:10:54,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 11:10:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-02-02 11:10:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-02-02 11:10:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 11:10:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-02-02 11:10:54,970 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 136 [2018-02-02 11:10:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:54,971 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-02-02 11:10:54,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 11:10:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-02-02 11:10:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-02-02 11:10:54,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:54,972 INFO L351 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:54,972 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1187663063, now seen corresponding path program 33 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:54,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:55,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:55,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 11:10:55,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:55,360 INFO L182 omatonBuilderFactory]: Interpolants [11712#(= main_~i~0 19), 11713#(= main_~i~0 20), 11714#(= main_~i~0 21), 11715#(= main_~i~0 22), 11716#(= main_~i~0 23), 11717#(= main_~i~0 24), 11718#(= main_~i~0 25), 11719#(= main_~i~0 26), 11720#(= main_~i~0 27), 11721#(= main_~i~0 28), 11722#(= main_~i~0 29), 11723#(= main_~i~0 30), 11724#(= main_~i~0 31), 11725#(= main_~i~0 32), 11726#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 11689#true, 11690#false, 11693#(= main_~i~0 0), 11694#(= main_~i~0 1), 11695#(= main_~i~0 2), 11696#(= main_~i~0 3), 11697#(= main_~i~0 4), 11698#(= main_~i~0 5), 11699#(= main_~i~0 6), 11700#(= main_~i~0 7), 11701#(= main_~i~0 8), 11702#(= main_~i~0 9), 11703#(= main_~i~0 10), 11704#(= main_~i~0 11), 11705#(= main_~i~0 12), 11706#(= main_~i~0 13), 11707#(= main_~i~0 14), 11708#(= main_~i~0 15), 11709#(= main_~i~0 16), 11710#(= main_~i~0 17), 11711#(= main_~i~0 18)] [2018-02-02 11:10:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:55,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 11:10:55,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 11:10:55,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 11:10:55,361 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 36 states. [2018-02-02 11:10:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:57,013 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-02-02 11:10:57,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 11:10:57,014 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2018-02-02 11:10:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:57,015 INFO L225 Difference]: With dead ends: 319 [2018-02-02 11:10:57,015 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 11:10:57,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 11:10:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 11:10:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-02-02 11:10:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 11:10:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-02-02 11:10:57,017 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 140 [2018-02-02 11:10:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:57,017 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-02-02 11:10:57,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 11:10:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-02-02 11:10:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-02-02 11:10:57,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:57,018 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:57,018 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash -209983454, now seen corresponding path program 34 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:57,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:57,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:57,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 11:10:57,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:57,378 INFO L182 omatonBuilderFactory]: Interpolants [12365#true, 12366#false, 12369#(= main_~i~0 0), 12370#(= main_~i~0 1), 12371#(= main_~i~0 2), 12372#(= main_~i~0 3), 12373#(= main_~i~0 4), 12374#(= main_~i~0 5), 12375#(= main_~i~0 6), 12376#(= main_~i~0 7), 12377#(= main_~i~0 8), 12378#(= main_~i~0 9), 12379#(= main_~i~0 10), 12380#(= main_~i~0 11), 12381#(= main_~i~0 12), 12382#(= main_~i~0 13), 12383#(= main_~i~0 14), 12384#(= main_~i~0 15), 12385#(= main_~i~0 16), 12386#(= main_~i~0 17), 12387#(= main_~i~0 18), 12388#(= main_~i~0 19), 12389#(= main_~i~0 20), 12390#(= main_~i~0 21), 12391#(= main_~i~0 22), 12392#(= main_~i~0 23), 12393#(= main_~i~0 24), 12394#(= main_~i~0 25), 12395#(= main_~i~0 26), 12396#(= main_~i~0 27), 12397#(= main_~i~0 28), 12398#(= main_~i~0 29), 12399#(= main_~i~0 30), 12400#(= main_~i~0 31), 12401#(= main_~i~0 32), 12402#(= main_~i~0 33), 12403#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:57,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 11:10:57,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 11:10:57,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 11:10:57,379 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 37 states. [2018-02-02 11:10:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:10:59,116 INFO L93 Difference]: Finished difference Result 328 states and 329 transitions. [2018-02-02 11:10:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 11:10:59,117 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-02-02 11:10:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:10:59,117 INFO L225 Difference]: With dead ends: 328 [2018-02-02 11:10:59,118 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 11:10:59,118 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 11:10:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 11:10:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-02 11:10:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 11:10:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 329 transitions. [2018-02-02 11:10:59,120 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 329 transitions. Word has length 144 [2018-02-02 11:10:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:10:59,120 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 329 transitions. [2018-02-02 11:10:59,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 11:10:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 329 transitions. [2018-02-02 11:10:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 11:10:59,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:10:59,121 INFO L351 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 11:10:59,121 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:10:59,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2059601765, now seen corresponding path program 35 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:10:59,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:10:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:10:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:59,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:10:59,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 11:10:59,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:10:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:59,540 INFO L182 omatonBuilderFactory]: Interpolants [13060#true, 13061#false, 13064#(= main_~i~0 0), 13065#(= main_~i~0 1), 13066#(= main_~i~0 2), 13067#(= main_~i~0 3), 13068#(= main_~i~0 4), 13069#(= main_~i~0 5), 13070#(= main_~i~0 6), 13071#(= main_~i~0 7), 13072#(= main_~i~0 8), 13073#(= main_~i~0 9), 13074#(= main_~i~0 10), 13075#(= main_~i~0 11), 13076#(= main_~i~0 12), 13077#(= main_~i~0 13), 13078#(= main_~i~0 14), 13079#(= main_~i~0 15), 13080#(= main_~i~0 16), 13081#(= main_~i~0 17), 13082#(= main_~i~0 18), 13083#(= main_~i~0 19), 13084#(= main_~i~0 20), 13085#(= main_~i~0 21), 13086#(= main_~i~0 22), 13087#(= main_~i~0 23), 13088#(= main_~i~0 24), 13089#(= main_~i~0 25), 13090#(= main_~i~0 26), 13091#(= main_~i~0 27), 13092#(= main_~i~0 28), 13093#(= main_~i~0 29), 13094#(= main_~i~0 30), 13095#(= main_~i~0 31), 13096#(= main_~i~0 32), 13097#(= main_~i~0 33), 13098#(= main_~i~0 34), 13099#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:10:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:10:59,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 11:10:59,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 11:10:59,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 11:10:59,541 INFO L87 Difference]: Start difference. First operand 328 states and 329 transitions. Second operand 38 states. [2018-02-02 11:11:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:01,576 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-02-02 11:11:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 11:11:01,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-02-02 11:11:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:01,578 INFO L225 Difference]: With dead ends: 337 [2018-02-02 11:11:01,578 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 11:11:01,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 11:11:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 11:11:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-02-02 11:11:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-02-02 11:11:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-02-02 11:11:01,581 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 148 [2018-02-02 11:11:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:01,581 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-02-02 11:11:01,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 11:11:01,581 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-02-02 11:11:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 11:11:01,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:01,582 INFO L351 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:01,582 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 916399252, now seen corresponding path program 36 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:01,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:02,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:02,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-02-02 11:11:02,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:02,040 INFO L182 omatonBuilderFactory]: Interpolants [13774#true, 13775#false, 13778#(= main_~i~0 0), 13779#(= main_~i~0 1), 13780#(= main_~i~0 2), 13781#(= main_~i~0 3), 13782#(= main_~i~0 4), 13783#(= main_~i~0 5), 13784#(= main_~i~0 6), 13785#(= main_~i~0 7), 13786#(= main_~i~0 8), 13787#(= main_~i~0 9), 13788#(= main_~i~0 10), 13789#(= main_~i~0 11), 13790#(= main_~i~0 12), 13791#(= main_~i~0 13), 13792#(= main_~i~0 14), 13793#(= main_~i~0 15), 13794#(= main_~i~0 16), 13795#(= main_~i~0 17), 13796#(= main_~i~0 18), 13797#(= main_~i~0 19), 13798#(= main_~i~0 20), 13799#(= main_~i~0 21), 13800#(= main_~i~0 22), 13801#(= main_~i~0 23), 13802#(= main_~i~0 24), 13803#(= main_~i~0 25), 13804#(= main_~i~0 26), 13805#(= main_~i~0 27), 13806#(= main_~i~0 28), 13807#(= main_~i~0 29), 13808#(= main_~i~0 30), 13809#(= main_~i~0 31), 13810#(= main_~i~0 32), 13811#(= main_~i~0 33), 13812#(= main_~i~0 34), 13813#(= main_~i~0 35), 13814#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:11:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:02,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 11:11:02,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 11:11:02,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 11:11:02,041 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 39 states. [2018-02-02 11:11:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:04,298 INFO L93 Difference]: Finished difference Result 346 states and 347 transitions. [2018-02-02 11:11:04,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 11:11:04,298 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 152 [2018-02-02 11:11:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:04,299 INFO L225 Difference]: With dead ends: 346 [2018-02-02 11:11:04,299 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 11:11:04,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 11:11:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 11:11:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-02-02 11:11:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 11:11:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 347 transitions. [2018-02-02 11:11:04,302 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 347 transitions. Word has length 152 [2018-02-02 11:11:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:04,302 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 347 transitions. [2018-02-02 11:11:04,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 11:11:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 347 transitions. [2018-02-02 11:11:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-02-02 11:11:04,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:04,303 INFO L351 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:04,303 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash -760697843, now seen corresponding path program 37 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:04,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:04,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:04,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 11:11:04,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:04,738 INFO L182 omatonBuilderFactory]: Interpolants [14528#(= main_~i~0 17), 14529#(= main_~i~0 18), 14530#(= main_~i~0 19), 14531#(= main_~i~0 20), 14532#(= main_~i~0 21), 14533#(= main_~i~0 22), 14534#(= main_~i~0 23), 14535#(= main_~i~0 24), 14536#(= main_~i~0 25), 14537#(= main_~i~0 26), 14538#(= main_~i~0 27), 14539#(= main_~i~0 28), 14540#(= main_~i~0 29), 14541#(= main_~i~0 30), 14542#(= main_~i~0 31), 14543#(= main_~i~0 32), 14544#(= main_~i~0 33), 14545#(= main_~i~0 34), 14546#(= main_~i~0 35), 14547#(= main_~i~0 36), 14548#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 14507#true, 14508#false, 14511#(= main_~i~0 0), 14512#(= main_~i~0 1), 14513#(= main_~i~0 2), 14514#(= main_~i~0 3), 14515#(= main_~i~0 4), 14516#(= main_~i~0 5), 14517#(= main_~i~0 6), 14518#(= main_~i~0 7), 14519#(= main_~i~0 8), 14520#(= main_~i~0 9), 14521#(= main_~i~0 10), 14522#(= main_~i~0 11), 14523#(= main_~i~0 12), 14524#(= main_~i~0 13), 14525#(= main_~i~0 14), 14526#(= main_~i~0 15), 14527#(= main_~i~0 16)] [2018-02-02 11:11:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:04,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 11:11:04,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 11:11:04,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 11:11:04,739 INFO L87 Difference]: Start difference. First operand 346 states and 347 transitions. Second operand 40 states. [2018-02-02 11:11:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:06,736 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-02-02 11:11:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 11:11:06,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 156 [2018-02-02 11:11:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:06,737 INFO L225 Difference]: With dead ends: 355 [2018-02-02 11:11:06,737 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 11:11:06,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 11:11:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 11:11:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-02-02 11:11:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 11:11:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-02-02 11:11:06,740 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 156 [2018-02-02 11:11:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:06,740 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-02-02 11:11:06,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 11:11:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-02-02 11:11:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 11:11:06,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:06,741 INFO L351 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:06,741 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:06,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1220555002, now seen corresponding path program 38 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:06,743 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:07,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:07,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 11:11:07,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:07,135 INFO L182 omatonBuilderFactory]: Interpolants [15296#(= main_~i~0 33), 15297#(= main_~i~0 34), 15298#(= main_~i~0 35), 15299#(= main_~i~0 36), 15300#(= main_~i~0 37), 15301#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 15259#true, 15260#false, 15263#(= main_~i~0 0), 15264#(= main_~i~0 1), 15265#(= main_~i~0 2), 15266#(= main_~i~0 3), 15267#(= main_~i~0 4), 15268#(= main_~i~0 5), 15269#(= main_~i~0 6), 15270#(= main_~i~0 7), 15271#(= main_~i~0 8), 15272#(= main_~i~0 9), 15273#(= main_~i~0 10), 15274#(= main_~i~0 11), 15275#(= main_~i~0 12), 15276#(= main_~i~0 13), 15277#(= main_~i~0 14), 15278#(= main_~i~0 15), 15279#(= main_~i~0 16), 15280#(= main_~i~0 17), 15281#(= main_~i~0 18), 15282#(= main_~i~0 19), 15283#(= main_~i~0 20), 15284#(= main_~i~0 21), 15285#(= main_~i~0 22), 15286#(= main_~i~0 23), 15287#(= main_~i~0 24), 15288#(= main_~i~0 25), 15289#(= main_~i~0 26), 15290#(= main_~i~0 27), 15291#(= main_~i~0 28), 15292#(= main_~i~0 29), 15293#(= main_~i~0 30), 15294#(= main_~i~0 31), 15295#(= main_~i~0 32)] [2018-02-02 11:11:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:07,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 11:11:07,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 11:11:07,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 11:11:07,137 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 41 states. [2018-02-02 11:11:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:09,233 INFO L93 Difference]: Finished difference Result 364 states and 365 transitions. [2018-02-02 11:11:09,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 11:11:09,233 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-02-02 11:11:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:09,234 INFO L225 Difference]: With dead ends: 364 [2018-02-02 11:11:09,234 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 11:11:09,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 11:11:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 11:11:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2018-02-02 11:11:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 11:11:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 365 transitions. [2018-02-02 11:11:09,237 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 365 transitions. Word has length 160 [2018-02-02 11:11:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:09,237 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 365 transitions. [2018-02-02 11:11:09,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 11:11:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 365 transitions. [2018-02-02 11:11:09,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 11:11:09,238 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:09,238 INFO L351 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:09,238 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1697303935, now seen corresponding path program 39 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:09,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:09,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:09,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 11:11:09,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:09,661 INFO L182 omatonBuilderFactory]: Interpolants [16064#(= main_~i~0 30), 16065#(= main_~i~0 31), 16066#(= main_~i~0 32), 16067#(= main_~i~0 33), 16068#(= main_~i~0 34), 16069#(= main_~i~0 35), 16070#(= main_~i~0 36), 16071#(= main_~i~0 37), 16072#(= main_~i~0 38), 16073#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 16030#true, 16031#false, 16034#(= main_~i~0 0), 16035#(= main_~i~0 1), 16036#(= main_~i~0 2), 16037#(= main_~i~0 3), 16038#(= main_~i~0 4), 16039#(= main_~i~0 5), 16040#(= main_~i~0 6), 16041#(= main_~i~0 7), 16042#(= main_~i~0 8), 16043#(= main_~i~0 9), 16044#(= main_~i~0 10), 16045#(= main_~i~0 11), 16046#(= main_~i~0 12), 16047#(= main_~i~0 13), 16048#(= main_~i~0 14), 16049#(= main_~i~0 15), 16050#(= main_~i~0 16), 16051#(= main_~i~0 17), 16052#(= main_~i~0 18), 16053#(= main_~i~0 19), 16054#(= main_~i~0 20), 16055#(= main_~i~0 21), 16056#(= main_~i~0 22), 16057#(= main_~i~0 23), 16058#(= main_~i~0 24), 16059#(= main_~i~0 25), 16060#(= main_~i~0 26), 16061#(= main_~i~0 27), 16062#(= main_~i~0 28), 16063#(= main_~i~0 29)] [2018-02-02 11:11:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:09,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 11:11:09,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 11:11:09,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 11:11:09,662 INFO L87 Difference]: Start difference. First operand 364 states and 365 transitions. Second operand 42 states. [2018-02-02 11:11:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:11,923 INFO L93 Difference]: Finished difference Result 373 states and 374 transitions. [2018-02-02 11:11:11,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 11:11:11,924 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 164 [2018-02-02 11:11:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:11,924 INFO L225 Difference]: With dead ends: 373 [2018-02-02 11:11:11,924 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 11:11:11,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 11:11:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 11:11:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-02 11:11:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-02 11:11:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-02-02 11:11:11,929 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 164 [2018-02-02 11:11:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:11,929 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-02-02 11:11:11,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 11:11:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-02-02 11:11:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-02 11:11:11,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:11,930 INFO L351 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:11,930 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 269477752, now seen corresponding path program 40 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:11,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:12,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:12,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 11:11:12,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:12,405 INFO L182 omatonBuilderFactory]: Interpolants [16832#(= main_~i~0 8), 16833#(= main_~i~0 9), 16834#(= main_~i~0 10), 16835#(= main_~i~0 11), 16836#(= main_~i~0 12), 16837#(= main_~i~0 13), 16838#(= main_~i~0 14), 16839#(= main_~i~0 15), 16840#(= main_~i~0 16), 16841#(= main_~i~0 17), 16842#(= main_~i~0 18), 16843#(= main_~i~0 19), 16844#(= main_~i~0 20), 16845#(= main_~i~0 21), 16846#(= main_~i~0 22), 16847#(= main_~i~0 23), 16848#(= main_~i~0 24), 16849#(= main_~i~0 25), 16850#(= main_~i~0 26), 16851#(= main_~i~0 27), 16852#(= main_~i~0 28), 16853#(= main_~i~0 29), 16854#(= main_~i~0 30), 16855#(= main_~i~0 31), 16856#(= main_~i~0 32), 16857#(= main_~i~0 33), 16858#(= main_~i~0 34), 16859#(= main_~i~0 35), 16860#(= main_~i~0 36), 16861#(= main_~i~0 37), 16862#(= main_~i~0 38), 16863#(= main_~i~0 39), 16864#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 16820#true, 16821#false, 16824#(= main_~i~0 0), 16825#(= main_~i~0 1), 16826#(= main_~i~0 2), 16827#(= main_~i~0 3), 16828#(= main_~i~0 4), 16829#(= main_~i~0 5), 16830#(= main_~i~0 6), 16831#(= main_~i~0 7)] [2018-02-02 11:11:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:12,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 11:11:12,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 11:11:12,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 11:11:12,406 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 43 states. [2018-02-02 11:11:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:14,769 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2018-02-02 11:11:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 11:11:14,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 168 [2018-02-02 11:11:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:14,770 INFO L225 Difference]: With dead ends: 382 [2018-02-02 11:11:14,770 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 11:11:14,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 11:11:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 11:11:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-02-02 11:11:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 11:11:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2018-02-02 11:11:14,773 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 168 [2018-02-02 11:11:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:14,773 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2018-02-02 11:11:14,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 11:11:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2018-02-02 11:11:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 11:11:14,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:14,774 INFO L351 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:14,774 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 779443441, now seen corresponding path program 41 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:14,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:15,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:15,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 11:11:15,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:15,240 INFO L182 omatonBuilderFactory]: Interpolants [17664#(= main_~i~0 31), 17665#(= main_~i~0 32), 17666#(= main_~i~0 33), 17667#(= main_~i~0 34), 17668#(= main_~i~0 35), 17669#(= main_~i~0 36), 17670#(= main_~i~0 37), 17671#(= main_~i~0 38), 17672#(= main_~i~0 39), 17673#(= main_~i~0 40), 17674#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 17629#true, 17630#false, 17633#(= main_~i~0 0), 17634#(= main_~i~0 1), 17635#(= main_~i~0 2), 17636#(= main_~i~0 3), 17637#(= main_~i~0 4), 17638#(= main_~i~0 5), 17639#(= main_~i~0 6), 17640#(= main_~i~0 7), 17641#(= main_~i~0 8), 17642#(= main_~i~0 9), 17643#(= main_~i~0 10), 17644#(= main_~i~0 11), 17645#(= main_~i~0 12), 17646#(= main_~i~0 13), 17647#(= main_~i~0 14), 17648#(= main_~i~0 15), 17649#(= main_~i~0 16), 17650#(= main_~i~0 17), 17651#(= main_~i~0 18), 17652#(= main_~i~0 19), 17653#(= main_~i~0 20), 17654#(= main_~i~0 21), 17655#(= main_~i~0 22), 17656#(= main_~i~0 23), 17657#(= main_~i~0 24), 17658#(= main_~i~0 25), 17659#(= main_~i~0 26), 17660#(= main_~i~0 27), 17661#(= main_~i~0 28), 17662#(= main_~i~0 29), 17663#(= main_~i~0 30)] [2018-02-02 11:11:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:15,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 11:11:15,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 11:11:15,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 11:11:15,241 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 44 states. [2018-02-02 11:11:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:17,786 INFO L93 Difference]: Finished difference Result 391 states and 392 transitions. [2018-02-02 11:11:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 11:11:17,786 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 172 [2018-02-02 11:11:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:17,787 INFO L225 Difference]: With dead ends: 391 [2018-02-02 11:11:17,787 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 11:11:17,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 11:11:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 11:11:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-02-02 11:11:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-02 11:11:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-02-02 11:11:17,790 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 172 [2018-02-02 11:11:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:17,790 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-02-02 11:11:17,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 11:11:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-02-02 11:11:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-02 11:11:17,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:17,791 INFO L351 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:17,791 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash 163671530, now seen corresponding path program 42 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:17,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:18,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:18,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-02-02 11:11:18,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:18,274 INFO L182 omatonBuilderFactory]: Interpolants [18496#(= main_~i~0 35), 18497#(= main_~i~0 36), 18498#(= main_~i~0 37), 18499#(= main_~i~0 38), 18500#(= main_~i~0 39), 18501#(= main_~i~0 40), 18502#(= main_~i~0 41), 18503#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 18457#true, 18458#false, 18461#(= main_~i~0 0), 18462#(= main_~i~0 1), 18463#(= main_~i~0 2), 18464#(= main_~i~0 3), 18465#(= main_~i~0 4), 18466#(= main_~i~0 5), 18467#(= main_~i~0 6), 18468#(= main_~i~0 7), 18469#(= main_~i~0 8), 18470#(= main_~i~0 9), 18471#(= main_~i~0 10), 18472#(= main_~i~0 11), 18473#(= main_~i~0 12), 18474#(= main_~i~0 13), 18475#(= main_~i~0 14), 18476#(= main_~i~0 15), 18477#(= main_~i~0 16), 18478#(= main_~i~0 17), 18479#(= main_~i~0 18), 18480#(= main_~i~0 19), 18481#(= main_~i~0 20), 18482#(= main_~i~0 21), 18483#(= main_~i~0 22), 18484#(= main_~i~0 23), 18485#(= main_~i~0 24), 18486#(= main_~i~0 25), 18487#(= main_~i~0 26), 18488#(= main_~i~0 27), 18489#(= main_~i~0 28), 18490#(= main_~i~0 29), 18491#(= main_~i~0 30), 18492#(= main_~i~0 31), 18493#(= main_~i~0 32), 18494#(= main_~i~0 33), 18495#(= main_~i~0 34)] [2018-02-02 11:11:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:18,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 11:11:18,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 11:11:18,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 11:11:18,276 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 45 states. [2018-02-02 11:11:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:20,850 INFO L93 Difference]: Finished difference Result 400 states and 401 transitions. [2018-02-02 11:11:20,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 11:11:20,850 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 176 [2018-02-02 11:11:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:20,851 INFO L225 Difference]: With dead ends: 400 [2018-02-02 11:11:20,851 INFO L226 Difference]: Without dead ends: 400 [2018-02-02 11:11:20,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 11:11:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-02-02 11:11:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-02-02 11:11:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 11:11:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-02-02 11:11:20,855 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 176 [2018-02-02 11:11:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:20,855 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-02-02 11:11:20,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 11:11:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-02-02 11:11:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-02 11:11:20,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:20,856 INFO L351 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:20,857 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1312447075, now seen corresponding path program 43 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:20,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:21,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:21,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 11:11:21,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:21,442 INFO L182 omatonBuilderFactory]: Interpolants [19328#(= main_~i~0 20), 19329#(= main_~i~0 21), 19330#(= main_~i~0 22), 19331#(= main_~i~0 23), 19332#(= main_~i~0 24), 19333#(= main_~i~0 25), 19334#(= main_~i~0 26), 19335#(= main_~i~0 27), 19336#(= main_~i~0 28), 19337#(= main_~i~0 29), 19338#(= main_~i~0 30), 19339#(= main_~i~0 31), 19340#(= main_~i~0 32), 19341#(= main_~i~0 33), 19342#(= main_~i~0 34), 19343#(= main_~i~0 35), 19344#(= main_~i~0 36), 19345#(= main_~i~0 37), 19346#(= main_~i~0 38), 19347#(= main_~i~0 39), 19348#(= main_~i~0 40), 19349#(= main_~i~0 41), 19350#(= main_~i~0 42), 19351#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 19304#true, 19305#false, 19308#(= main_~i~0 0), 19309#(= main_~i~0 1), 19310#(= main_~i~0 2), 19311#(= main_~i~0 3), 19312#(= main_~i~0 4), 19313#(= main_~i~0 5), 19314#(= main_~i~0 6), 19315#(= main_~i~0 7), 19316#(= main_~i~0 8), 19317#(= main_~i~0 9), 19318#(= main_~i~0 10), 19319#(= main_~i~0 11), 19320#(= main_~i~0 12), 19321#(= main_~i~0 13), 19322#(= main_~i~0 14), 19323#(= main_~i~0 15), 19324#(= main_~i~0 16), 19325#(= main_~i~0 17), 19326#(= main_~i~0 18), 19327#(= main_~i~0 19)] [2018-02-02 11:11:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:21,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 11:11:21,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 11:11:21,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 11:11:21,443 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 46 states. [2018-02-02 11:11:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:24,167 INFO L93 Difference]: Finished difference Result 409 states and 410 transitions. [2018-02-02 11:11:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 11:11:24,167 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 180 [2018-02-02 11:11:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:24,168 INFO L225 Difference]: With dead ends: 409 [2018-02-02 11:11:24,168 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 11:11:24,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 11:11:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 11:11:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-02-02 11:11:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-02-02 11:11:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-02-02 11:11:24,171 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 180 [2018-02-02 11:11:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:24,171 INFO L432 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-02-02 11:11:24,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 11:11:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-02-02 11:11:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-02-02 11:11:24,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:24,172 INFO L351 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:24,172 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1694080420, now seen corresponding path program 44 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:24,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:24,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:24,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-02-02 11:11:24,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:24,687 INFO L182 omatonBuilderFactory]: Interpolants [20170#true, 20171#false, 20174#(= main_~i~0 0), 20175#(= main_~i~0 1), 20176#(= main_~i~0 2), 20177#(= main_~i~0 3), 20178#(= main_~i~0 4), 20179#(= main_~i~0 5), 20180#(= main_~i~0 6), 20181#(= main_~i~0 7), 20182#(= main_~i~0 8), 20183#(= main_~i~0 9), 20184#(= main_~i~0 10), 20185#(= main_~i~0 11), 20186#(= main_~i~0 12), 20187#(= main_~i~0 13), 20188#(= main_~i~0 14), 20189#(= main_~i~0 15), 20190#(= main_~i~0 16), 20191#(= main_~i~0 17), 20192#(= main_~i~0 18), 20193#(= main_~i~0 19), 20194#(= main_~i~0 20), 20195#(= main_~i~0 21), 20196#(= main_~i~0 22), 20197#(= main_~i~0 23), 20198#(= main_~i~0 24), 20199#(= main_~i~0 25), 20200#(= main_~i~0 26), 20201#(= main_~i~0 27), 20202#(= main_~i~0 28), 20203#(= main_~i~0 29), 20204#(= main_~i~0 30), 20205#(= main_~i~0 31), 20206#(= main_~i~0 32), 20207#(= main_~i~0 33), 20208#(= main_~i~0 34), 20209#(= main_~i~0 35), 20210#(= main_~i~0 36), 20211#(= main_~i~0 37), 20212#(= main_~i~0 38), 20213#(= main_~i~0 39), 20214#(= main_~i~0 40), 20215#(= main_~i~0 41), 20216#(= main_~i~0 42), 20217#(= main_~i~0 43), 20218#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:11:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:24,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 11:11:24,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 11:11:24,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 11:11:24,688 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 47 states. [2018-02-02 11:11:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:27,439 INFO L93 Difference]: Finished difference Result 418 states and 419 transitions. [2018-02-02 11:11:27,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 11:11:27,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 184 [2018-02-02 11:11:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:27,440 INFO L225 Difference]: With dead ends: 418 [2018-02-02 11:11:27,440 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 11:11:27,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 11:11:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 11:11:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-02-02 11:11:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-02 11:11:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 419 transitions. [2018-02-02 11:11:27,443 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 419 transitions. Word has length 184 [2018-02-02 11:11:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:27,443 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 419 transitions. [2018-02-02 11:11:27,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 11:11:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 419 transitions. [2018-02-02 11:11:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-02-02 11:11:27,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:27,444 INFO L351 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:27,444 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash 304858581, now seen corresponding path program 45 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:27,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:27,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:27,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 11:11:27,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:27,964 INFO L182 omatonBuilderFactory]: Interpolants [21056#false, 21059#(= main_~i~0 0), 21060#(= main_~i~0 1), 21061#(= main_~i~0 2), 21062#(= main_~i~0 3), 21063#(= main_~i~0 4), 21064#(= main_~i~0 5), 21065#(= main_~i~0 6), 21066#(= main_~i~0 7), 21067#(= main_~i~0 8), 21068#(= main_~i~0 9), 21069#(= main_~i~0 10), 21070#(= main_~i~0 11), 21071#(= main_~i~0 12), 21072#(= main_~i~0 13), 21073#(= main_~i~0 14), 21074#(= main_~i~0 15), 21075#(= main_~i~0 16), 21076#(= main_~i~0 17), 21077#(= main_~i~0 18), 21078#(= main_~i~0 19), 21079#(= main_~i~0 20), 21080#(= main_~i~0 21), 21081#(= main_~i~0 22), 21082#(= main_~i~0 23), 21083#(= main_~i~0 24), 21084#(= main_~i~0 25), 21085#(= main_~i~0 26), 21086#(= main_~i~0 27), 21087#(= main_~i~0 28), 21088#(= main_~i~0 29), 21089#(= main_~i~0 30), 21090#(= main_~i~0 31), 21091#(= main_~i~0 32), 21092#(= main_~i~0 33), 21093#(= main_~i~0 34), 21094#(= main_~i~0 35), 21095#(= main_~i~0 36), 21096#(= main_~i~0 37), 21097#(= main_~i~0 38), 21098#(= main_~i~0 39), 21099#(= main_~i~0 40), 21100#(= main_~i~0 41), 21101#(= main_~i~0 42), 21102#(= main_~i~0 43), 21103#(= main_~i~0 44), 21104#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 21055#true] [2018-02-02 11:11:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:27,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 11:11:27,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 11:11:27,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 11:11:27,965 INFO L87 Difference]: Start difference. First operand 418 states and 419 transitions. Second operand 48 states. [2018-02-02 11:11:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:30,496 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-02-02 11:11:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 11:11:30,496 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 188 [2018-02-02 11:11:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:30,497 INFO L225 Difference]: With dead ends: 427 [2018-02-02 11:11:30,497 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 11:11:30,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 11:11:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 11:11:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-02-02 11:11:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 11:11:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-02-02 11:11:30,499 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 188 [2018-02-02 11:11:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:30,499 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-02-02 11:11:30,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 11:11:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-02-02 11:11:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 11:11:30,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:30,500 INFO L351 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:30,500 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -393165618, now seen corresponding path program 46 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:30,502 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:31,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:31,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 11:11:31,006 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:31,007 INFO L182 omatonBuilderFactory]: Interpolants [21959#true, 21960#false, 21963#(= main_~i~0 0), 21964#(= main_~i~0 1), 21965#(= main_~i~0 2), 21966#(= main_~i~0 3), 21967#(= main_~i~0 4), 21968#(= main_~i~0 5), 21969#(= main_~i~0 6), 21970#(= main_~i~0 7), 21971#(= main_~i~0 8), 21972#(= main_~i~0 9), 21973#(= main_~i~0 10), 21974#(= main_~i~0 11), 21975#(= main_~i~0 12), 21976#(= main_~i~0 13), 21977#(= main_~i~0 14), 21978#(= main_~i~0 15), 21979#(= main_~i~0 16), 21980#(= main_~i~0 17), 21981#(= main_~i~0 18), 21982#(= main_~i~0 19), 21983#(= main_~i~0 20), 21984#(= main_~i~0 21), 21985#(= main_~i~0 22), 21986#(= main_~i~0 23), 21987#(= main_~i~0 24), 21988#(= main_~i~0 25), 21989#(= main_~i~0 26), 21990#(= main_~i~0 27), 21991#(= main_~i~0 28), 21992#(= main_~i~0 29), 21993#(= main_~i~0 30), 21994#(= main_~i~0 31), 21995#(= main_~i~0 32), 21996#(= main_~i~0 33), 21997#(= main_~i~0 34), 21998#(= main_~i~0 35), 21999#(= main_~i~0 36), 22000#(= main_~i~0 37), 22001#(= main_~i~0 38), 22002#(= main_~i~0 39), 22003#(= main_~i~0 40), 22004#(= main_~i~0 41), 22005#(= main_~i~0 42), 22006#(= main_~i~0 43), 22007#(= main_~i~0 44), 22008#(= main_~i~0 45), 22009#(and (<= 0 main_~i~0) (< main_~i~0 1024))] [2018-02-02 11:11:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:31,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 11:11:31,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 11:11:31,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 11:11:31,008 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 49 states. [2018-02-02 11:11:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 11:11:33,745 INFO L93 Difference]: Finished difference Result 436 states and 437 transitions. [2018-02-02 11:11:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 11:11:33,745 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 192 [2018-02-02 11:11:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 11:11:33,746 INFO L225 Difference]: With dead ends: 436 [2018-02-02 11:11:33,746 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 11:11:33,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 11:11:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 11:11:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-02-02 11:11:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 11:11:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 437 transitions. [2018-02-02 11:11:33,748 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 437 transitions. Word has length 192 [2018-02-02 11:11:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 11:11:33,748 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 437 transitions. [2018-02-02 11:11:33,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 11:11:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 437 transitions. [2018-02-02 11:11:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-02-02 11:11:33,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 11:11:33,749 INFO L351 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 11:11:33,749 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-02 11:11:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -168059065, now seen corresponding path program 47 times No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-02-02 11:11:33,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 11:11:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 11:11:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:34,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 11:11:34,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 11:11:34,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 11:11:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:34,263 INFO L182 omatonBuilderFactory]: Interpolants [22912#(= main_~i~0 26), 22913#(= main_~i~0 27), 22914#(= main_~i~0 28), 22915#(= main_~i~0 29), 22916#(= main_~i~0 30), 22917#(= main_~i~0 31), 22918#(= main_~i~0 32), 22919#(= main_~i~0 33), 22920#(= main_~i~0 34), 22921#(= main_~i~0 35), 22922#(= main_~i~0 36), 22923#(= main_~i~0 37), 22924#(= main_~i~0 38), 22925#(= main_~i~0 39), 22926#(= main_~i~0 40), 22927#(= main_~i~0 41), 22928#(= main_~i~0 42), 22929#(= main_~i~0 43), 22930#(= main_~i~0 44), 22931#(= main_~i~0 45), 22932#(= main_~i~0 46), 22933#(and (<= 0 main_~i~0) (< main_~i~0 1024)), 22882#true, 22883#false, 22886#(= main_~i~0 0), 22887#(= main_~i~0 1), 22888#(= main_~i~0 2), 22889#(= main_~i~0 3), 22890#(= main_~i~0 4), 22891#(= main_~i~0 5), 22892#(= main_~i~0 6), 22893#(= main_~i~0 7), 22894#(= main_~i~0 8), 22895#(= main_~i~0 9), 22896#(= main_~i~0 10), 22897#(= main_~i~0 11), 22898#(= main_~i~0 12), 22899#(= main_~i~0 13), 22900#(= main_~i~0 14), 22901#(= main_~i~0 15), 22902#(= main_~i~0 16), 22903#(= main_~i~0 17), 22904#(= main_~i~0 18), 22905#(= main_~i~0 19), 22906#(= main_~i~0 20), 22907#(= main_~i~0 21), 22908#(= main_~i~0 22), 22909#(= main_~i~0 23), 22910#(= main_~i~0 24), 22911#(= main_~i~0 25)] [2018-02-02 11:11:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 11:11:34,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 11:11:34,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 11:11:34,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 11:11:34,263 INFO L87 Difference]: Start difference. First operand 436 states and 437 transitions. Second operand 50 states. Received shutdown request... [2018-02-02 11:11:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 11:11:36,978 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 11:11:37,029 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 11:11:37,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 11:11:37 BoogieIcfgContainer [2018-02-02 11:11:37,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 11:11:37,030 INFO L168 Benchmark]: Toolchain (without parser) took 67010.37 ms. Allocated memory was 402.7 MB in the beginning and 965.7 MB in the end (delta: 563.1 MB). Free memory was 359.3 MB in the beginning and 933.1 MB in the end (delta: -573.8 MB). Peak memory consumption was 406.3 MB. Max. memory is 5.3 GB. [2018-02-02 11:11:37,030 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 11:11:37,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.27 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 351.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-02 11:11:37,031 INFO L168 Benchmark]: Boogie Preprocessor took 20.87 ms. Allocated memory is still 402.7 MB. Free memory is still 351.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 11:11:37,031 INFO L168 Benchmark]: RCFGBuilder took 127.49 ms. Allocated memory is still 402.7 MB. Free memory was 351.4 MB in the beginning and 336.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 11:11:37,031 INFO L168 Benchmark]: TraceAbstraction took 66719.63 ms. Allocated memory was 402.7 MB in the beginning and 965.7 MB in the end (delta: 563.1 MB). Free memory was 336.9 MB in the beginning and 933.1 MB in the end (delta: -596.2 MB). Peak memory consumption was 383.8 MB. Max. memory is 5.3 GB. [2018-02-02 11:11:37,032 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 402.7 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.27 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 351.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.87 ms. Allocated memory is still 402.7 MB. Free memory is still 351.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 127.49 ms. Allocated memory is still 402.7 MB. Free memory was 351.4 MB in the beginning and 336.9 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66719.63 ms. Allocated memory was 402.7 MB in the beginning and 965.7 MB in the end (delta: 563.1 MB). Free memory was 336.9 MB in the beginning and 933.1 MB in the end (delta: -596.2 MB). Peak memory consumption was 383.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (436states) and interpolant automaton (currently 50 states, 50 states before enhancement), while ReachableStatesComputation was computing reachable states (414 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (436states) and interpolant automaton (currently 50 states, 50 states before enhancement), while ReachableStatesComputation was computing reachable states (414 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 66.6s OverallTime, 48 OverallIterations, 48 TraceHistogramMax, 54.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2694 SDtfs, 7080 SDslu, 72588 SDs, 0 SdLazy, 254149 SolverSat, 2795 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/72568 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 47 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 4896 NumberOfCodeBlocks, 4896 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 4848 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 1 PerfectInterpolantSequences, 0/72568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_11-11-37-036.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_z3.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_11-11-37-036.csv Completed graceful shutdown