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/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e-m [2018-01-31 08:16:55,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:16:55,107 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:16:55,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:16:55,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:16:55,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:16:55,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:16:55,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:16:55,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:16:55,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:16:55,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:16:55,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:16:55,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:16:55,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:16:55,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:16:55,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:16:55,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:16:55,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:16:55,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:16:55,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:16:55,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:16:55,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:16:55,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:16:55,142 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:16:55,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:16:55,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:16:55,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:16:55,143 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:16:55,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:16:55,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:16:55,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:16:55,144 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:16:55,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:16:55,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:16:55,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:16:55,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:16:55,156 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:16:55,156 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:16:55,156 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:16:55,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-31 08:16:55,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:16:55,158 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-31 08:16:55,158 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-31 08:16:55,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:16:55,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:16:55,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:16:55,160 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:16:55,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:16:55,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:16:55,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:16:55,160 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:16:55,160 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:16:55,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:16:55,195 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:16:55,198 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:16:55,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:16:55,199 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:16:55,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_true-unreach-call_ground.i [2018-01-31 08:16:55,268 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:16:55,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:16:55,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:16:55,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:16:55,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:16:55,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23500962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55, skipping insertion in model container [2018-01-31 08:16:55,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,284 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:16:55,293 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:16:55,377 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:16:55,392 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:16:55,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55 WrapperNode [2018-01-31 08:16:55,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:16:55,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:16:55,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:16:55,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:16:55,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... [2018-01-31 08:16:55,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:16:55,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:16:55,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:16:55,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:16:55,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (1/1) ... No working directory specified, using /home/daniel/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-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure insert [2018-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-01-31 08:16:55,456 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:16:55,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:16:55,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:16:55,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:16:55,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure insert [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure elem_exists [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:16:55,457 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:16:55,813 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:16:55,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:16:55 BoogieIcfgContainer [2018-01-31 08:16:55,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:16:55,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:16:55,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:16:55,816 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:16:55,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:16:55" (1/3) ... [2018-01-31 08:16:55,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a1491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:16:55, skipping insertion in model container [2018-01-31 08:16:55,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:16:55" (2/3) ... [2018-01-31 08:16:55,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8a1491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:16:55, skipping insertion in model container [2018-01-31 08:16:55,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:16:55" (3/3) ... [2018-01-31 08:16:55,818 INFO L107 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_true-unreach-call_ground.i [2018-01-31 08:16:55,823 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:16:55,827 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-31 08:16:55,852 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:16:55,852 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:16:55,852 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:16:55,852 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:16:55,852 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:16:55,852 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:16:55,852 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:16:55,853 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:16:55,853 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:16:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-01-31 08:16:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:16:55,866 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:55,867 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:55,867 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1642714808, now seen corresponding path program 1 times [2018-01-31 08:16:55,871 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:55,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:55,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:55,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:55,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:55,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:16:56,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:16:56,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:16:56,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:16:56,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:16:56,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:16:56,199 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 5 states. [2018-01-31 08:16:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:56,365 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2018-01-31 08:16:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:16:56,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:16:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:56,371 INFO L225 Difference]: With dead ends: 194 [2018-01-31 08:16:56,371 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:16:56,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:16:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:16:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-01-31 08:16:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:16:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-31 08:16:56,455 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 22 [2018-01-31 08:16:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:56,456 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-31 08:16:56,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:16:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-31 08:16:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:16:56,458 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:56,458 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:56,458 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -670847349, now seen corresponding path program 1 times [2018-01-31 08:16:56,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:56,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:56,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:56,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:56,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:16:56,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:16:56,540 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:16:56,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:56,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:16:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:16:56,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:16:56,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-31 08:16:56,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:16:56,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:16:56,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:16:56,664 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 7 states. [2018-01-31 08:16:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:56,801 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2018-01-31 08:16:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:16:56,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-01-31 08:16:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:56,803 INFO L225 Difference]: With dead ends: 148 [2018-01-31 08:16:56,803 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 08:16:56,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:16:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 08:16:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2018-01-31 08:16:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 08:16:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-01-31 08:16:56,813 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 60 [2018-01-31 08:16:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:56,813 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-01-31 08:16:56,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:16:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-01-31 08:16:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:16:56,815 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:56,816 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:56,816 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash 47184782, now seen corresponding path program 1 times [2018-01-31 08:16:56,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:56,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:56,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:56,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:56,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:16:56,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:16:56,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:16:56,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:16:56,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:16:56,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:16:56,885 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 4 states. [2018-01-31 08:16:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:56,940 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-31 08:16:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:16:56,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-01-31 08:16:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:56,942 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:16:56,942 INFO L226 Difference]: Without dead ends: 110 [2018-01-31 08:16:56,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:16:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-31 08:16:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-31 08:16:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:16:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-01-31 08:16:56,948 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 79 [2018-01-31 08:16:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:56,949 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-01-31 08:16:56,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:16:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-01-31 08:16:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-31 08:16:56,950 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:56,950 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:56,950 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:56,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1076656949, now seen corresponding path program 1 times [2018-01-31 08:16:56,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:56,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:56,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:56,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:56,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-31 08:16:57,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:16:57,080 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:16:57,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:57,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:16:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-31 08:16:57,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:16:57,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 08:16:57,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:16:57,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:16:57,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:16:57,170 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 9 states. [2018-01-31 08:16:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:57,534 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2018-01-31 08:16:57,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:16:57,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-01-31 08:16:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:57,536 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:16:57,537 INFO L226 Difference]: Without dead ends: 158 [2018-01-31 08:16:57,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:16:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-31 08:16:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-01-31 08:16:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-31 08:16:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2018-01-31 08:16:57,547 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 82 [2018-01-31 08:16:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:57,548 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2018-01-31 08:16:57,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:16:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2018-01-31 08:16:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-31 08:16:57,549 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:57,549 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:57,549 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1424304907, now seen corresponding path program 2 times [2018-01-31 08:16:57,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:57,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:57,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:57,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:57,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:57,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-31 08:16:57,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:16:57,795 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:16:57,800 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:16:57,810 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:16:57,833 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:16:57,844 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:16:57,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:16:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-31 08:16:58,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:16:58,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-31 08:16:58,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:16:58,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:16:58,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:16:58,014 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 14 states. [2018-01-31 08:16:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:58,411 INFO L93 Difference]: Finished difference Result 217 states and 249 transitions. [2018-01-31 08:16:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:16:58,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-01-31 08:16:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:58,412 INFO L225 Difference]: With dead ends: 217 [2018-01-31 08:16:58,412 INFO L226 Difference]: Without dead ends: 195 [2018-01-31 08:16:58,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:16:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-31 08:16:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2018-01-31 08:16:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-31 08:16:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2018-01-31 08:16:58,423 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 104 [2018-01-31 08:16:58,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:58,423 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2018-01-31 08:16:58,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:16:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2018-01-31 08:16:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-31 08:16:58,425 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:58,425 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:58,425 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:58,425 INFO L82 PathProgramCache]: Analyzing trace with hash -957091139, now seen corresponding path program 3 times [2018-01-31 08:16:58,425 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:58,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:58,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:58,426 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:16:58,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:58,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-31 08:16:58,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:16:58,542 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:16:58,546 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:16:58,560 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:16:58,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:16:58,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:16:58,594 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:16:58,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:16:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-31 08:16:58,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:16:58,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-01-31 08:16:58,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:16:58,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:16:58,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:16:58,943 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand 18 states. [2018-01-31 08:16:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:16:59,331 INFO L93 Difference]: Finished difference Result 347 states and 405 transitions. [2018-01-31 08:16:59,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:16:59,332 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2018-01-31 08:16:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:16:59,333 INFO L225 Difference]: With dead ends: 347 [2018-01-31 08:16:59,333 INFO L226 Difference]: Without dead ends: 269 [2018-01-31 08:16:59,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:16:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-31 08:16:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 210. [2018-01-31 08:16:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-31 08:16:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2018-01-31 08:16:59,345 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 112 [2018-01-31 08:16:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:16:59,345 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2018-01-31 08:16:59,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:16:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2018-01-31 08:16:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-31 08:16:59,346 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:16:59,346 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:16:59,346 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:16:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash 21097042, now seen corresponding path program 1 times [2018-01-31 08:16:59,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:16:59,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:16:59,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:59,347 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:16:59,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:16:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:59,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:16:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-31 08:16:59,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:16:59,510 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:16:59,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:16:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:16:59,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:16:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-31 08:16:59,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:16:59,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-01-31 08:16:59,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:16:59,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:16:59,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:16:59,647 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand 17 states. [2018-01-31 08:17:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:00,397 INFO L93 Difference]: Finished difference Result 372 states and 449 transitions. [2018-01-31 08:17:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-31 08:17:00,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-01-31 08:17:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:00,399 INFO L225 Difference]: With dead ends: 372 [2018-01-31 08:17:00,399 INFO L226 Difference]: Without dead ends: 332 [2018-01-31 08:17:00,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 08:17:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-31 08:17:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 241. [2018-01-31 08:17:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-31 08:17:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 286 transitions. [2018-01-31 08:17:00,414 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 286 transitions. Word has length 112 [2018-01-31 08:17:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:00,414 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 286 transitions. [2018-01-31 08:17:00,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:17:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 286 transitions. [2018-01-31 08:17:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-31 08:17:00,416 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:00,416 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:00,416 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2098253216, now seen corresponding path program 4 times [2018-01-31 08:17:00,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:00,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:00,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:00,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:00,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:00,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-01-31 08:17:00,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:00,463 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:00,467 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:17:00,497 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:00,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-31 08:17:00,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:17:00,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-01-31 08:17:00,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:17:00,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:17:00,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:17:00,536 INFO L87 Difference]: Start difference. First operand 241 states and 286 transitions. Second operand 6 states. [2018-01-31 08:17:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:00,555 INFO L93 Difference]: Finished difference Result 415 states and 492 transitions. [2018-01-31 08:17:00,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:17:00,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-01-31 08:17:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:00,556 INFO L225 Difference]: With dead ends: 415 [2018-01-31 08:17:00,556 INFO L226 Difference]: Without dead ends: 241 [2018-01-31 08:17:00,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:17:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-31 08:17:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 237. [2018-01-31 08:17:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-31 08:17:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 273 transitions. [2018-01-31 08:17:00,563 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 273 transitions. Word has length 137 [2018-01-31 08:17:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:00,563 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 273 transitions. [2018-01-31 08:17:00,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:17:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 273 transitions. [2018-01-31 08:17:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-31 08:17:00,564 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:00,564 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:00,564 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -367394389, now seen corresponding path program 1 times [2018-01-31 08:17:00,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:00,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:00,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:00,565 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:00,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:00,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-31 08:17:00,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:00,732 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:00,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:00,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-31 08:17:00,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:00,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-01-31 08:17:00,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:17:00,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:17:00,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:17:00,919 INFO L87 Difference]: Start difference. First operand 237 states and 273 transitions. Second operand 13 states. [2018-01-31 08:17:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:01,091 INFO L93 Difference]: Finished difference Result 400 states and 472 transitions. [2018-01-31 08:17:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:17:01,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2018-01-31 08:17:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:01,093 INFO L225 Difference]: With dead ends: 400 [2018-01-31 08:17:01,093 INFO L226 Difference]: Without dead ends: 371 [2018-01-31 08:17:01,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:17:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-31 08:17:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 294. [2018-01-31 08:17:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-31 08:17:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2018-01-31 08:17:01,102 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 142 [2018-01-31 08:17:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:01,102 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2018-01-31 08:17:01,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:17:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2018-01-31 08:17:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-01-31 08:17:01,104 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:01,104 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:01,104 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1960392725, now seen corresponding path program 2 times [2018-01-31 08:17:01,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:01,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:01,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:01,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:01,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:01,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-31 08:17:01,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:01,282 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:01,288 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:17:01,297 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:01,310 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:01,313 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:01,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-31 08:17:01,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:01,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-01-31 08:17:01,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:17:01,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:17:01,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:17:01,389 INFO L87 Difference]: Start difference. First operand 294 states and 344 transitions. Second operand 15 states. [2018-01-31 08:17:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:01,956 INFO L93 Difference]: Finished difference Result 457 states and 543 transitions. [2018-01-31 08:17:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:17:01,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-01-31 08:17:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:01,958 INFO L225 Difference]: With dead ends: 457 [2018-01-31 08:17:01,958 INFO L226 Difference]: Without dead ends: 428 [2018-01-31 08:17:01,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:17:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-31 08:17:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 351. [2018-01-31 08:17:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-31 08:17:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 415 transitions. [2018-01-31 08:17:01,967 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 415 transitions. Word has length 164 [2018-01-31 08:17:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:01,968 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 415 transitions. [2018-01-31 08:17:01,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:17:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 415 transitions. [2018-01-31 08:17:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-31 08:17:01,969 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:01,969 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:01,969 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2078187989, now seen corresponding path program 3 times [2018-01-31 08:17:01,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:01,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:01,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:01,970 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:01,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:01,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-01-31 08:17:02,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:02,139 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:02,144 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:17:02,152 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:02,156 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:02,160 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:02,171 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:02,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:02,632 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_~size Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_insert_#in~set.base| (store (select |c_old(#memory_int)| |c_insert_#in~set.base|) (+ (* 4 insert_~size) |c_insert_#in~set.offset|) |c_insert_#in~value|))) (<= |c_insert_#res| (+ insert_~size 1)) (<= insert_~size |c_insert_#in~size|))) is different from true [2018-01-31 08:17:02,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-31 08:17:02,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:17:02,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-31 08:17:02,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-31 08:17:02,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:17:02,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:17:02,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:17:02,709 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:36 [2018-01-31 08:17:03,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-31 08:17:03,104 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:17:03,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:17:03,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:03,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:03,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:03,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:4 [2018-01-31 08:17:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-31 08:17:03,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:03,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 30] total 43 [2018-01-31 08:17:03,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 08:17:03,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 08:17:03,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1581, Unknown=1, NotChecked=80, Total=1806 [2018-01-31 08:17:03,211 INFO L87 Difference]: Start difference. First operand 351 states and 415 transitions. Second operand 43 states. [2018-01-31 08:17:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:10,614 INFO L93 Difference]: Finished difference Result 887 states and 1173 transitions. [2018-01-31 08:17:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-01-31 08:17:10,615 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-01-31 08:17:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:10,617 INFO L225 Difference]: With dead ends: 887 [2018-01-31 08:17:10,618 INFO L226 Difference]: Without dead ends: 858 [2018-01-31 08:17:10,621 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8917 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2532, Invalid=23877, Unknown=1, NotChecked=322, Total=26732 [2018-01-31 08:17:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-01-31 08:17:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 524. [2018-01-31 08:17:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-01-31 08:17:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 646 transitions. [2018-01-31 08:17:10,642 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 646 transitions. Word has length 186 [2018-01-31 08:17:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:10,642 INFO L432 AbstractCegarLoop]: Abstraction has 524 states and 646 transitions. [2018-01-31 08:17:10,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 08:17:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 646 transitions. [2018-01-31 08:17:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-01-31 08:17:10,645 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:10,645 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:10,645 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2043993166, now seen corresponding path program 1 times [2018-01-31 08:17:10,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:10,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:10,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:10,646 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:10,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:10,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:10,962 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-31 08:17:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2018-01-31 08:17:11,132 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:11,132 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:11,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:11,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-01-31 08:17:11,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:11,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-01-31 08:17:11,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-31 08:17:11,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-31 08:17:11,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:17:11,474 INFO L87 Difference]: Start difference. First operand 524 states and 646 transitions. Second operand 30 states. [2018-01-31 08:17:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:14,074 INFO L93 Difference]: Finished difference Result 1099 states and 1366 transitions. [2018-01-31 08:17:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-01-31 08:17:14,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 216 [2018-01-31 08:17:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:14,077 INFO L225 Difference]: With dead ends: 1099 [2018-01-31 08:17:14,077 INFO L226 Difference]: Without dead ends: 1057 [2018-01-31 08:17:14,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7517 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3581, Invalid=17589, Unknown=0, NotChecked=0, Total=21170 [2018-01-31 08:17:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-01-31 08:17:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 807. [2018-01-31 08:17:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-01-31 08:17:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1009 transitions. [2018-01-31 08:17:14,104 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1009 transitions. Word has length 216 [2018-01-31 08:17:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:14,105 INFO L432 AbstractCegarLoop]: Abstraction has 807 states and 1009 transitions. [2018-01-31 08:17:14,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-31 08:17:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1009 transitions. [2018-01-31 08:17:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-01-31 08:17:14,107 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:14,107 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:14,107 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash -826919975, now seen corresponding path program 4 times [2018-01-31 08:17:14,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:14,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:14,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:14,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:14,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:14,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 158 proven. 50 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2018-01-31 08:17:14,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:14,289 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:14,295 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:17:14,334 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:14,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 167 proven. 43 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2018-01-31 08:17:14,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:14,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-01-31 08:17:14,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:17:14,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:17:14,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:17:14,423 INFO L87 Difference]: Start difference. First operand 807 states and 1009 transitions. Second operand 18 states. [2018-01-31 08:17:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:14,702 INFO L93 Difference]: Finished difference Result 1502 states and 1912 transitions. [2018-01-31 08:17:14,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:17:14,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 238 [2018-01-31 08:17:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:14,705 INFO L225 Difference]: With dead ends: 1502 [2018-01-31 08:17:14,705 INFO L226 Difference]: Without dead ends: 699 [2018-01-31 08:17:14,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:17:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-01-31 08:17:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2018-01-31 08:17:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-01-31 08:17:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 881 transitions. [2018-01-31 08:17:14,729 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 881 transitions. Word has length 238 [2018-01-31 08:17:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:14,729 INFO L432 AbstractCegarLoop]: Abstraction has 699 states and 881 transitions. [2018-01-31 08:17:14,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:17:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 881 transitions. [2018-01-31 08:17:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-31 08:17:14,732 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:14,732 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:14,732 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1903907496, now seen corresponding path program 1 times [2018-01-31 08:17:14,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:14,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:14,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:14,733 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:14,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:14,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:15,091 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-31 08:17:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 9 proven. 80 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-01-31 08:17:15,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:15,234 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:15,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:15,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-01-31 08:17:15,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:15,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-01-31 08:17:15,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 08:17:15,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 08:17:15,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:17:15,501 INFO L87 Difference]: Start difference. First operand 699 states and 881 transitions. Second operand 32 states. [2018-01-31 08:17:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:17,907 INFO L93 Difference]: Finished difference Result 1099 states and 1378 transitions. [2018-01-31 08:17:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-01-31 08:17:17,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 244 [2018-01-31 08:17:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:17,910 INFO L225 Difference]: With dead ends: 1099 [2018-01-31 08:17:17,911 INFO L226 Difference]: Without dead ends: 1035 [2018-01-31 08:17:17,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9592 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4391, Invalid=21691, Unknown=0, NotChecked=0, Total=26082 [2018-01-31 08:17:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-01-31 08:17:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 785. [2018-01-31 08:17:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-01-31 08:17:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 995 transitions. [2018-01-31 08:17:17,944 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 995 transitions. Word has length 244 [2018-01-31 08:17:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:17,945 INFO L432 AbstractCegarLoop]: Abstraction has 785 states and 995 transitions. [2018-01-31 08:17:17,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 08:17:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 995 transitions. [2018-01-31 08:17:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-01-31 08:17:17,947 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:17,948 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:17,948 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 642318180, now seen corresponding path program 2 times [2018-01-31 08:17:17,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:17,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:17,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:17,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:17,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:17,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2018-01-31 08:17:18,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:18,449 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:18,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:17:18,473 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:18,493 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:18,497 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:18,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-01-31 08:17:18,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:17:18,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 22 [2018-01-31 08:17:18,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:17:18,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:17:18,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:17:18,615 INFO L87 Difference]: Start difference. First operand 785 states and 995 transitions. Second operand 22 states. [2018-01-31 08:17:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:18,862 INFO L93 Difference]: Finished difference Result 1057 states and 1333 transitions. [2018-01-31 08:17:18,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:17:18,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 268 [2018-01-31 08:17:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:18,864 INFO L225 Difference]: With dead ends: 1057 [2018-01-31 08:17:18,864 INFO L226 Difference]: Without dead ends: 676 [2018-01-31 08:17:18,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:17:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-01-31 08:17:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 673. [2018-01-31 08:17:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-01-31 08:17:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 819 transitions. [2018-01-31 08:17:18,889 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 819 transitions. Word has length 268 [2018-01-31 08:17:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:18,889 INFO L432 AbstractCegarLoop]: Abstraction has 673 states and 819 transitions. [2018-01-31 08:17:18,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:17:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 819 transitions. [2018-01-31 08:17:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-01-31 08:17:18,891 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:18,891 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:18,891 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1881770105, now seen corresponding path program 3 times [2018-01-31 08:17:18,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:18,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:18,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:18,892 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:18,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:18,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:19,296 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-31 08:17:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-01-31 08:17:19,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:19,494 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:19,499 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:17:19,509 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:19,513 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:19,514 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:19,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-01-31 08:17:19,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:19,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 18 [2018-01-31 08:17:19,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:17:19,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:17:19,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:17:19,561 INFO L87 Difference]: Start difference. First operand 673 states and 819 transitions. Second operand 18 states. [2018-01-31 08:17:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:20,049 INFO L93 Difference]: Finished difference Result 794 states and 956 transitions. [2018-01-31 08:17:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:17:20,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 268 [2018-01-31 08:17:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:20,052 INFO L225 Difference]: With dead ends: 794 [2018-01-31 08:17:20,052 INFO L226 Difference]: Without dead ends: 730 [2018-01-31 08:17:20,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:17:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-01-31 08:17:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 611. [2018-01-31 08:17:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-01-31 08:17:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 747 transitions. [2018-01-31 08:17:20,072 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 747 transitions. Word has length 268 [2018-01-31 08:17:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:20,072 INFO L432 AbstractCegarLoop]: Abstraction has 611 states and 747 transitions. [2018-01-31 08:17:20,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:17:20,072 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 747 transitions. [2018-01-31 08:17:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-01-31 08:17:20,074 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:20,075 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:20,075 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1757000313, now seen corresponding path program 5 times [2018-01-31 08:17:20,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:20,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:20,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:20,076 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:20,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:20,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-01-31 08:17:20,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:20,380 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:20,385 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:17:20,396 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,399 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,402 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,404 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,407 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,410 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,415 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,420 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,426 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:20,433 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:20,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2018-01-31 08:17:20,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:20,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-01-31 08:17:20,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:17:20,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:17:20,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:17:20,555 INFO L87 Difference]: Start difference. First operand 611 states and 747 transitions. Second operand 23 states. [2018-01-31 08:17:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:20,784 INFO L93 Difference]: Finished difference Result 852 states and 1041 transitions. [2018-01-31 08:17:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 08:17:20,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 276 [2018-01-31 08:17:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:20,786 INFO L225 Difference]: With dead ends: 852 [2018-01-31 08:17:20,786 INFO L226 Difference]: Without dead ends: 814 [2018-01-31 08:17:20,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:17:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2018-01-31 08:17:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 684. [2018-01-31 08:17:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2018-01-31 08:17:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 840 transitions. [2018-01-31 08:17:20,808 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 840 transitions. Word has length 276 [2018-01-31 08:17:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:20,808 INFO L432 AbstractCegarLoop]: Abstraction has 684 states and 840 transitions. [2018-01-31 08:17:20,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:17:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 840 transitions. [2018-01-31 08:17:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-01-31 08:17:20,810 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:20,811 INFO L351 BasicCegarLoop]: trace histogram [13, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:20,811 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash -997930823, now seen corresponding path program 6 times [2018-01-31 08:17:20,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:20,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:20,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:20,811 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:20,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:20,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2018-01-31 08:17:21,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:21,173 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:21,178 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:17:21,189 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,204 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,213 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,226 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,236 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,250 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,255 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:17:21,256 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:21,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:21,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-01-31 08:17:21,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:17:21,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-01-31 08:17:21,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:17:21,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-01-31 08:17:21,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-01-31 08:17:21,774 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_~set.offset Int) (insert_~size Int) (insert_~value Int)) (and (<= |c_insert_#res| (+ insert_~size 1)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_insert_#in~set.base| (store (select |c_old(#memory_int)| |c_insert_#in~set.base|) (+ insert_~set.offset (* 4 insert_~size)) insert_~value))) (<= |c_insert_#in~size| insert_~size) (<= |c_insert_#in~set.offset| insert_~set.offset))) is different from true [2018-01-31 08:17:21,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-31 08:17:21,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:17:21,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:17:21,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 50 [2018-01-31 08:17:21,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-31 08:17:21,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-01-31 08:17:21,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-01-31 08:17:21,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:21,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-01-31 08:17:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 246 proven. 243 refuted. 0 times theorem prover too weak. 562 trivial. 4 not checked. [2018-01-31 08:17:22,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:22,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 36] total 57 [2018-01-31 08:17:22,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-31 08:17:22,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-31 08:17:22,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2832, Unknown=5, NotChecked=108, Total=3192 [2018-01-31 08:17:22,073 INFO L87 Difference]: Start difference. First operand 684 states and 840 transitions. Second operand 57 states. [2018-01-31 08:17:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:29,364 INFO L93 Difference]: Finished difference Result 1000 states and 1224 transitions. [2018-01-31 08:17:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-01-31 08:17:29,364 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 298 [2018-01-31 08:17:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:29,367 INFO L225 Difference]: With dead ends: 1000 [2018-01-31 08:17:29,367 INFO L226 Difference]: Without dead ends: 944 [2018-01-31 08:17:29,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 266 SyntacticMatches, 1 SemanticMatches, 242 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20783 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4231, Invalid=54572, Unknown=7, NotChecked=482, Total=59292 [2018-01-31 08:17:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-01-31 08:17:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 623. [2018-01-31 08:17:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-01-31 08:17:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 722 transitions. [2018-01-31 08:17:29,448 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 722 transitions. Word has length 298 [2018-01-31 08:17:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:29,448 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 722 transitions. [2018-01-31 08:17:29,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-31 08:17:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 722 transitions. [2018-01-31 08:17:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-01-31 08:17:29,450 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:29,450 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:29,450 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash 342839416, now seen corresponding path program 2 times [2018-01-31 08:17:29,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:29,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:29,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:29,452 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:29,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:29,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:29,765 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 8 DAG size of output 6 [2018-01-31 08:17:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 261 proven. 65 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2018-01-31 08:17:29,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:29,857 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:29,872 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:17:29,885 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:29,917 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:29,922 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:29,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 321 proven. 2 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2018-01-31 08:17:30,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:30,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2018-01-31 08:17:30,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:17:30,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:17:30,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:17:30,933 INFO L87 Difference]: Start difference. First operand 623 states and 722 transitions. Second operand 20 states. [2018-01-31 08:17:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:31,172 INFO L93 Difference]: Finished difference Result 861 states and 1046 transitions. [2018-01-31 08:17:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:17:31,172 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 326 [2018-01-31 08:17:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:31,174 INFO L225 Difference]: With dead ends: 861 [2018-01-31 08:17:31,175 INFO L226 Difference]: Without dead ends: 652 [2018-01-31 08:17:31,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:17:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-31 08:17:31,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 631. [2018-01-31 08:17:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-01-31 08:17:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 731 transitions. [2018-01-31 08:17:31,199 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 731 transitions. Word has length 326 [2018-01-31 08:17:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:31,200 INFO L432 AbstractCegarLoop]: Abstraction has 631 states and 731 transitions. [2018-01-31 08:17:31,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:17:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 731 transitions. [2018-01-31 08:17:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-01-31 08:17:31,202 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:31,202 INFO L351 BasicCegarLoop]: trace histogram [14, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:31,202 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 470139174, now seen corresponding path program 3 times [2018-01-31 08:17:31,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:31,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:31,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:31,203 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:31,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:31,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 2 proven. 505 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2018-01-31 08:17:31,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:31,766 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:31,778 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:17:31,790 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:31,794 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:31,799 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:31,809 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:31,821 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:31,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:32,179 WARN L1033 $PredicateComparison]: unable to prove that (exists ((insert_~size Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_insert_#in~set.base| (store (select |c_old(#memory_int)| |c_insert_#in~set.base|) (+ (* 4 insert_~size) |c_insert_#in~set.offset|) |c_insert_#in~value|))) (<= |c_insert_#res| (+ insert_~size 1)) (<= insert_~size |c_insert_#in~size|))) is different from true [2018-01-31 08:17:32,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-31 08:17:32,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:17:32,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-31 08:17:32,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-01-31 08:17:32,196 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:17:32,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:17:32,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-31 08:17:32,211 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:36 [2018-01-31 08:17:32,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-31 08:17:32,600 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:17:32,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-31 08:17:32,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:32,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:32,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:32,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:4 [2018-01-31 08:17:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 300 proven. 23 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2018-01-31 08:17:32,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:32,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34] total 57 [2018-01-31 08:17:32,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-31 08:17:32,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-31 08:17:32,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2817, Unknown=1, NotChecked=108, Total=3192 [2018-01-31 08:17:32,776 INFO L87 Difference]: Start difference. First operand 631 states and 731 transitions. Second operand 57 states. [2018-01-31 08:17:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:44,146 INFO L93 Difference]: Finished difference Result 1418 states and 1795 transitions. [2018-01-31 08:17:44,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-01-31 08:17:44,146 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 334 [2018-01-31 08:17:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:44,149 INFO L225 Difference]: With dead ends: 1418 [2018-01-31 08:17:44,150 INFO L226 Difference]: Without dead ends: 1381 [2018-01-31 08:17:44,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30303 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7219, Invalid=73156, Unknown=1, NotChecked=564, Total=80940 [2018-01-31 08:17:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2018-01-31 08:17:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 878. [2018-01-31 08:17:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-01-31 08:17:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1049 transitions. [2018-01-31 08:17:44,196 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1049 transitions. Word has length 334 [2018-01-31 08:17:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:44,196 INFO L432 AbstractCegarLoop]: Abstraction has 878 states and 1049 transitions. [2018-01-31 08:17:44,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-31 08:17:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1049 transitions. [2018-01-31 08:17:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-01-31 08:17:44,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:44,199 INFO L351 BasicCegarLoop]: trace histogram [15, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:44,199 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1297040467, now seen corresponding path program 1 times [2018-01-31 08:17:44,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:44,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:44,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:44,200 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:44,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:44,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1529 backedges. 2 proven. 603 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-01-31 08:17:44,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:44,682 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:44,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:44,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1529 backedges. 0 proven. 603 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2018-01-31 08:17:44,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:44,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-01-31 08:17:44,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:17:44,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:17:44,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:17:44,806 INFO L87 Difference]: Start difference. First operand 878 states and 1049 transitions. Second operand 29 states. [2018-01-31 08:17:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:45,160 INFO L93 Difference]: Finished difference Result 1141 states and 1361 transitions. [2018-01-31 08:17:45,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:17:45,160 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 364 [2018-01-31 08:17:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:45,163 INFO L225 Difference]: With dead ends: 1141 [2018-01-31 08:17:45,163 INFO L226 Difference]: Without dead ends: 1081 [2018-01-31 08:17:45,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:17:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-01-31 08:17:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 951. [2018-01-31 08:17:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-01-31 08:17:45,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1139 transitions. [2018-01-31 08:17:45,209 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1139 transitions. Word has length 364 [2018-01-31 08:17:45,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:45,209 INFO L432 AbstractCegarLoop]: Abstraction has 951 states and 1139 transitions. [2018-01-31 08:17:45,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:17:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1139 transitions. [2018-01-31 08:17:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-01-31 08:17:45,212 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:45,212 INFO L351 BasicCegarLoop]: trace histogram [16, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:45,212 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:45,212 INFO L82 PathProgramCache]: Analyzing trace with hash 844829165, now seen corresponding path program 2 times [2018-01-31 08:17:45,212 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:45,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:45,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:45,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:17:45,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:45,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:45,573 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 9 DAG size of output 8 [2018-01-31 08:17:45,747 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 9 DAG size of output 8 [2018-01-31 08:17:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 1778 trivial. 0 not checked. [2018-01-31 08:17:45,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:45,852 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:45,857 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:17:45,869 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:45,908 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:17:45,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:45,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1792 backedges. 0 proven. 710 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2018-01-31 08:17:46,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:46,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 37 [2018-01-31 08:17:46,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:17:46,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:17:46,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:17:46,410 INFO L87 Difference]: Start difference. First operand 951 states and 1139 transitions. Second operand 37 states. [2018-01-31 08:17:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:48,125 INFO L93 Difference]: Finished difference Result 1262 states and 1505 transitions. [2018-01-31 08:17:48,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-01-31 08:17:48,125 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 386 [2018-01-31 08:17:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:48,128 INFO L225 Difference]: With dead ends: 1262 [2018-01-31 08:17:48,128 INFO L226 Difference]: Without dead ends: 1194 [2018-01-31 08:17:48,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4611 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3489, Invalid=12011, Unknown=0, NotChecked=0, Total=15500 [2018-01-31 08:17:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-01-31 08:17:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1036. [2018-01-31 08:17:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-01-31 08:17:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1241 transitions. [2018-01-31 08:17:48,182 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1241 transitions. Word has length 386 [2018-01-31 08:17:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:48,183 INFO L432 AbstractCegarLoop]: Abstraction has 1036 states and 1241 transitions. [2018-01-31 08:17:48,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:17:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1241 transitions. [2018-01-31 08:17:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-01-31 08:17:48,186 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:48,186 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:48,186 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash -328030572, now seen corresponding path program 4 times [2018-01-31 08:17:48,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:48,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:48,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:48,187 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:48,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:48,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 373 proven. 180 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2018-01-31 08:17:48,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:48,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:48,699 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:17:48,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:48,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2144 backedges. 392 proven. 158 refuted. 0 times theorem prover too weak. 1594 trivial. 0 not checked. [2018-01-31 08:17:48,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:17:48,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 24 [2018-01-31 08:17:48,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:17:48,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:17:48,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:17:48,901 INFO L87 Difference]: Start difference. First operand 1036 states and 1241 transitions. Second operand 24 states. [2018-01-31 08:17:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:17:49,237 INFO L93 Difference]: Finished difference Result 1676 states and 2089 transitions. [2018-01-31 08:17:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:17:49,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 408 [2018-01-31 08:17:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:17:49,240 INFO L225 Difference]: With dead ends: 1676 [2018-01-31 08:17:49,240 INFO L226 Difference]: Without dead ends: 1097 [2018-01-31 08:17:49,242 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:17:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-01-31 08:17:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1024. [2018-01-31 08:17:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-01-31 08:17:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1233 transitions. [2018-01-31 08:17:49,291 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1233 transitions. Word has length 408 [2018-01-31 08:17:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:17:49,291 INFO L432 AbstractCegarLoop]: Abstraction has 1024 states and 1233 transitions. [2018-01-31 08:17:49,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:17:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1233 transitions. [2018-01-31 08:17:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-01-31 08:17:49,294 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:17:49,294 INFO L351 BasicCegarLoop]: trace histogram [17, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:17:49,294 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:17:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash 23980698, now seen corresponding path program 3 times [2018-01-31 08:17:49,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:17:49,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:17:49,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:49,295 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:17:49,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:17:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:17:49,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:17:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 4 proven. 826 refuted. 0 times theorem prover too weak. 1270 trivial. 0 not checked. [2018-01-31 08:17:49,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:17:49,891 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:17:49,896 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:17:49,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:49,913 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:49,918 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:49,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:17:49,927 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:17:49,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:17:50,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:17:50,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:17:50,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:50,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:50,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:50,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:1 [2018-01-31 08:17:50,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-31 08:17:50,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:17:50,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-01-31 08:17:50,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:17:50,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-01-31 08:17:50,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:17:50,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:17:50,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:17:50,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:32 [2018-01-31 08:18:01,351 WARN L143 SmtUtils]: Spent 843ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-31 08:18:02,603 WARN L143 SmtUtils]: Spent 554ms on a formula simplification that was a NOOP. DAG size: 48 [2018-01-31 08:18:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-01-31 08:18:06,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:18:06,999 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:18:07,000 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:18:07,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-01-31 08:18:07,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:07,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:07,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:07,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:63, output treesize:4 [2018-01-31 08:18:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2100 backedges. 390 proven. 41 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2018-01-31 08:18:07,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:07,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39] total 68 [2018-01-31 08:18:07,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-31 08:18:07,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-31 08:18:07,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=4170, Unknown=5, NotChecked=0, Total=4556 [2018-01-31 08:18:07,292 INFO L87 Difference]: Start difference. First operand 1024 states and 1233 transitions. Second operand 68 states. [2018-01-31 08:18:14,720 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:188) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:635) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:597) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Broken pipe at java.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 29 more [2018-01-31 08:18:14,723 INFO L168 Benchmark]: Toolchain (without parser) took 79454.23 ms. Allocated memory was 152.0 MB in the beginning and 921.7 MB in the end (delta: 769.7 MB). Free memory was 117.2 MB in the beginning and 177.8 MB in the end (delta: -60.6 MB). Peak memory consumption was 709.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:14,724 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 152.0 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:18:14,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.70 ms. Allocated memory is still 152.0 MB. Free memory was 117.0 MB in the beginning and 108.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:14,724 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 152.0 MB. Free memory was 108.2 MB in the beginning and 106.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:14,724 INFO L168 Benchmark]: RCFGBuilder took 396.04 ms. Allocated memory is still 152.0 MB. Free memory was 106.4 MB in the beginning and 84.5 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:14,725 INFO L168 Benchmark]: TraceAbstraction took 78908.94 ms. Allocated memory was 152.0 MB in the beginning and 921.7 MB in the end (delta: 769.7 MB). Free memory was 84.3 MB in the beginning and 177.8 MB in the end (delta: -93.5 MB). Peak memory consumption was 676.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:14,725 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.11 ms. Allocated memory is still 152.0 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 126.70 ms. Allocated memory is still 152.0 MB. Free memory was 117.0 MB in the beginning and 108.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 152.0 MB. Free memory was 108.2 MB in the beginning and 106.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 396.04 ms. Allocated memory is still 152.0 MB. Free memory was 106.4 MB in the beginning and 84.5 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78908.94 ms. Allocated memory was 152.0 MB in the beginning and 921.7 MB in the end (delta: 769.7 MB). Free memory was 84.3 MB in the beginning and 177.8 MB in the end (delta: -93.5 MB). Peak memory consumption was 676.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/data_structures_set_multi_proc_true-unreach-call_ground.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-18-14-734.csv Received shutdown request...