java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:10:37,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:10:37,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:10:37,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:10:37,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:10:37,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:10:37,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:10:37,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:10:37,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:10:37,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:10:37,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:10:37,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:10:37,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:10:37,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:10:37,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:10:37,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:10:37,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:10:37,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:10:37,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:10:37,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:10:37,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:10:37,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:10:37,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:10:37,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:10:37,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:10:37,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:10:37,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:10:37,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:10:37,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:10:37,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:10:37,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:10:37,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:10:37,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:10:37,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:10:37,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:10:37,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:10:37,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:10:37,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:10:37,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:10:37,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:10:37,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:10:37,968 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:10:37,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:10:37,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:10:37,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:10:37,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:10:37,997 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:10:37,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:10:37,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:10:37,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:10:37,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:10:37,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:10:37,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:10:37,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:10:37,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:10:37,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:10:38,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:10:38,000 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:10:38,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:10:38,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:10:38,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:10:38,001 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:10:38,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:10:38,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:38,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:10:38,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:10:38,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:10:38,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:10:38,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:10:38,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:10:38,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:10:38,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:10:38,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:10:38,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:10:38,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:10:38,061 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:10:38,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2019-09-08 01:10:38,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d8d61d6/50fcb4f86c1742d4aecc63f8f48fe1d0/FLAG630ab7912 [2019-09-08 01:10:38,642 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:10:38,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2019-09-08 01:10:38,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d8d61d6/50fcb4f86c1742d4aecc63f8f48fe1d0/FLAG630ab7912 [2019-09-08 01:10:39,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d8d61d6/50fcb4f86c1742d4aecc63f8f48fe1d0 [2019-09-08 01:10:39,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:10:39,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:10:39,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:39,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:10:39,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:10:39,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39, skipping insertion in model container [2019-09-08 01:10:39,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,082 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:10:39,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:10:39,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:39,291 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:10:39,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:10:39,315 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:10:39,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39 WrapperNode [2019-09-08 01:10:39,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:10:39,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:10:39,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:10:39,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:10:39,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... [2019-09-08 01:10:39,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:10:39,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:10:39,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:10:39,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:10:39,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:10:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:10:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:10:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 01:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:10:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:10:39,648 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:10:39,648 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 01:10:39,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:39 BoogieIcfgContainer [2019-09-08 01:10:39,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:10:39,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:10:39,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:10:39,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:10:39,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:39" (1/3) ... [2019-09-08 01:10:39,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfa8781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:39, skipping insertion in model container [2019-09-08 01:10:39,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:39" (2/3) ... [2019-09-08 01:10:39,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfa8781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:39, skipping insertion in model container [2019-09-08 01:10:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:39" (3/3) ... [2019-09-08 01:10:39,660 INFO L109 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2019-09-08 01:10:39,667 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:10:39,674 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:10:39,691 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:10:39,720 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:10:39,721 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:10:39,721 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:10:39,721 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:10:39,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:10:39,722 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:10:39,722 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:10:39,722 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:10:39,722 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:10:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-09-08 01:10:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-09-08 01:10:39,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:39,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:39,749 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:39,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1301230683, now seen corresponding path program 1 times [2019-09-08 01:10:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:39,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:10:39,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:10:39,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:10:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:10:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:39,904 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-09-08 01:10:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:39,942 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-09-08 01:10:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:10:39,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-09-08 01:10:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:39,968 INFO L225 Difference]: With dead ends: 22 [2019-09-08 01:10:39,969 INFO L226 Difference]: Without dead ends: 11 [2019-09-08 01:10:39,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:10:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-09-08 01:10:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-09-08 01:10:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-09-08 01:10:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-09-08 01:10:40,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-09-08 01:10:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,048 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-09-08 01:10:40,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:10:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-09-08 01:10:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 01:10:40,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,059 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,062 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1683383028, now seen corresponding path program 1 times [2019-09-08 01:10:40,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-08 01:10:40,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 01:10:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 01:10:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:40,200 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-09-08 01:10:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,221 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-09-08 01:10:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:10:40,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-09-08 01:10:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,223 INFO L225 Difference]: With dead ends: 15 [2019-09-08 01:10:40,223 INFO L226 Difference]: Without dead ends: 12 [2019-09-08 01:10:40,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 01:10:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-08 01:10:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-08 01:10:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-08 01:10:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-08 01:10:40,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-08 01:10:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,228 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-08 01:10:40,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 01:10:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-08 01:10:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 01:10:40,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,229 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,230 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash 645203835, now seen corresponding path program 2 times [2019-09-08 01:10:40,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:10:40,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:40,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:40,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 01:10:40,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:10:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:10:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:40,350 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-08 01:10:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,372 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-09-08 01:10:40,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:10:40,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-08 01:10:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,375 INFO L225 Difference]: With dead ends: 16 [2019-09-08 01:10:40,375 INFO L226 Difference]: Without dead ends: 13 [2019-09-08 01:10:40,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:10:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-08 01:10:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-08 01:10:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-08 01:10:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-08 01:10:40,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-08 01:10:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,385 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-08 01:10:40,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:10:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-08 01:10:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 01:10:40,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,387 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1473580076, now seen corresponding path program 3 times [2019-09-08 01:10:40,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:10:40,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 01:10:40,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 01:10:40,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:10:40,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:10:40,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:40,526 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-08 01:10:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,557 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-09-08 01:10:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:10:40,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-08 01:10:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,559 INFO L225 Difference]: With dead ends: 17 [2019-09-08 01:10:40,559 INFO L226 Difference]: Without dead ends: 14 [2019-09-08 01:10:40,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:10:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-08 01:10:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-08 01:10:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-08 01:10:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-08 01:10:40,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-08 01:10:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,566 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-08 01:10:40,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:10:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-08 01:10:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 01:10:40,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,567 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,567 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1563595419, now seen corresponding path program 4 times [2019-09-08 01:10:40,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:10:40,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:10:40,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 01:10:40,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:10:40,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:10:40,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:40,723 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-08 01:10:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,748 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-08 01:10:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:10:40,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-08 01:10:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,749 INFO L225 Difference]: With dead ends: 18 [2019-09-08 01:10:40,750 INFO L226 Difference]: Without dead ends: 15 [2019-09-08 01:10:40,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:10:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-08 01:10:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-08 01:10:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-08 01:10:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-08 01:10:40,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-08 01:10:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,755 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-08 01:10:40,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:10:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-08 01:10:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 01:10:40,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,756 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,757 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1226755252, now seen corresponding path program 5 times [2019-09-08 01:10:40,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:40,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:40,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:10:40,865 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-08 01:10:40,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:40,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:10:40,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-09-08 01:10:40,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:10:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:10:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:40,893 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-08 01:10:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:40,946 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-08 01:10:40,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:10:40,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-08 01:10:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:40,948 INFO L225 Difference]: With dead ends: 19 [2019-09-08 01:10:40,949 INFO L226 Difference]: Without dead ends: 16 [2019-09-08 01:10:40,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:10:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-08 01:10:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-08 01:10:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-08 01:10:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-08 01:10:40,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-08 01:10:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:40,961 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-08 01:10:40,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:10:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-08 01:10:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-08 01:10:40,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:40,963 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:40,963 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -625355333, now seen corresponding path program 6 times [2019-09-08 01:10:40,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:40,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,144 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-08 01:10:41,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:41,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-08 01:10:41,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:10:41,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:10:41,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:41,171 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-08 01:10:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,200 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-08 01:10:41,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:10:41,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-08 01:10:41,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,201 INFO L225 Difference]: With dead ends: 20 [2019-09-08 01:10:41,202 INFO L226 Difference]: Without dead ends: 17 [2019-09-08 01:10:41,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:10:41,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-08 01:10:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-08 01:10:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-08 01:10:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-08 01:10:41,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-08 01:10:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,207 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-08 01:10:41,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:10:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-08 01:10:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 01:10:41,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,208 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,208 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2088758676, now seen corresponding path program 7 times [2019-09-08 01:10:41,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,297 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-09-08 01:10:41,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:10:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:10:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:41,347 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-09-08 01:10:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,377 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-08 01:10:41,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:10:41,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-08 01:10:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,379 INFO L225 Difference]: With dead ends: 21 [2019-09-08 01:10:41,380 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 01:10:41,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:10:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 01:10:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 01:10:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 01:10:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-09-08 01:10:41,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-09-08 01:10:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,385 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-09-08 01:10:41,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:10:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-09-08 01:10:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:10:41,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,386 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,386 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 326947035, now seen corresponding path program 8 times [2019-09-08 01:10:41,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:10:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:10:41,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:41,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,528 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:10:41,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 01:10:41,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:10:41,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:10:41,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:41,535 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2019-09-08 01:10:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,568 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-08 01:10:41,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:10:41,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-09-08 01:10:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,570 INFO L225 Difference]: With dead ends: 22 [2019-09-08 01:10:41,570 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 01:10:41,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:10:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 01:10:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 01:10:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 01:10:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-08 01:10:41,574 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-09-08 01:10:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,575 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-08 01:10:41,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:10:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-08 01:10:41,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:10:41,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,576 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,576 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1545361012, now seen corresponding path program 9 times [2019-09-08 01:10:41,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:10:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:10:41,680 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:10:41,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:10:41,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-08 01:10:41,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:10:41,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:10:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:10:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:10:41,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:10:41,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 01:10:41,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:10:41,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:10:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:41,730 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-09-08 01:10:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:10:41,757 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-09-08 01:10:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:10:41,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-09-08 01:10:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:10:41,759 INFO L225 Difference]: With dead ends: 23 [2019-09-08 01:10:41,759 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:10:41,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:10:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:10:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:10:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:10:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-09-08 01:10:41,764 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-09-08 01:10:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:10:41,764 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-09-08 01:10:41,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:10:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-09-08 01:10:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 01:10:41,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:10:41,765 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:10:41,766 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:10:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:10:41,766 INFO L82 PathProgramCache]: Analyzing trace with hash 661488635, now seen corresponding path program 10 times [2019-09-08 01:10:41,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:10:41,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:10:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:10:41,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:10:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:10:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:10:41,801 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:10:41,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:10:41 BoogieIcfgContainer [2019-09-08 01:10:41,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:10:41,833 INFO L168 Benchmark]: Toolchain (without parser) took 2767.08 ms. Allocated memory was 133.7 MB in the beginning and 226.0 MB in the end (delta: 92.3 MB). Free memory was 88.1 MB in the beginning and 114.3 MB in the end (delta: -26.2 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:41,834 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 01:10:41,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.08 ms. Allocated memory is still 133.7 MB. Free memory was 88.1 MB in the beginning and 79.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:41,836 INFO L168 Benchmark]: Boogie Preprocessor took 125.17 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 79.0 MB in the beginning and 176.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:41,836 INFO L168 Benchmark]: RCFGBuilder took 207.59 ms. Allocated memory is still 200.3 MB. Free memory was 176.9 MB in the beginning and 166.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:41,837 INFO L168 Benchmark]: TraceAbstraction took 2179.37 ms. Allocated memory was 200.3 MB in the beginning and 226.0 MB in the end (delta: 25.7 MB). Free memory was 166.1 MB in the beginning and 114.3 MB in the end (delta: 51.8 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:10:41,841 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 133.7 MB. Free memory is still 106.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.08 ms. Allocated memory is still 133.7 MB. Free memory was 88.1 MB in the beginning and 79.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.17 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 79.0 MB in the beginning and 176.9 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 207.59 ms. Allocated memory is still 200.3 MB. Free memory was 176.9 MB in the beginning and 166.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2179.37 ms. Allocated memory was 200.3 MB in the beginning and 226.0 MB in the end (delta: 25.7 MB). Free memory was 166.1 MB in the beginning and 114.3 MB in the end (delta: 51.8 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 27]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 14. Possible FailurePath: [L1] int __return_main; VAL [\old(__return_main)=1, __return_main=0] [L7] float main__tick = 0.10000000149011612; [L8] float main__time = 0.0; [L9] int main__i; [L10] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L12] COND TRUE main__i < 10 [L14] main__time = main__time + main__tick [L15] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L12] COND FALSE !(main__i < 10) [L21] int __tmp_1; [L22] __tmp_1 = main__time != 1.0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] __VERIFIER_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 14 locations, 1 error locations. UNSAFE Result, 2.1s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 0 SDslu, 319 SDs, 0 SdLazy, 110 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 6290 SizeOfPredicates, 9 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...