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/eca-rers2012/Problem12_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:02:57,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:02:57,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:02:57,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:02:57,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:02:57,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:02:57,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:02:57,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:02:57,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:02:57,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:02:57,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:02:57,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:02:57,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:02:57,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:02:57,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:02:57,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:02:57,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:02:57,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:02:57,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:02:57,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:02:57,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:02:57,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:02:57,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:02:57,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:02:57,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:02:57,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:02:57,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:02:57,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:02:57,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:02:57,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:02:57,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:02:57,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:02:57,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:02:57,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:02:57,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:02:57,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:02:57,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:02:57,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:02:57,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:02:57,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:02:57,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:02:57,940 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-07 19:02:57,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:02:57,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:02:57,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:02:57,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:02:57,966 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:02:57,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:02:57,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:02:57,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:02:57,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:02:57,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:02:57,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:02:57,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:02:57,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:02:57,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:02:57,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:02:57,969 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:02:57,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:02:57,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:02:57,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:02:57,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:02:57,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:02:57,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:02:57,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:02:57,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:02:57,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:02:57,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:02:57,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:02:57,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:02:57,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:02:58,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:02:58,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:02:58,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:02:58,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:02:58,021 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:02:58,022 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label42.c [2019-09-07 19:02:58,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa83ec648/86d7e5d85df5435980fbcc0a40aee7e1/FLAGd4fe83cba [2019-09-07 19:02:58,893 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:02:58,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label42.c [2019-09-07 19:02:58,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa83ec648/86d7e5d85df5435980fbcc0a40aee7e1/FLAGd4fe83cba [2019-09-07 19:02:59,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa83ec648/86d7e5d85df5435980fbcc0a40aee7e1 [2019-09-07 19:02:59,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:02:59,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:02:59,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:02:59,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:02:59,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:02:59,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:02:59" (1/1) ... [2019-09-07 19:02:59,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122e0d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:02:59, skipping insertion in model container [2019-09-07 19:02:59,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:02:59" (1/1) ... [2019-09-07 19:02:59,461 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:02:59,620 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:03:01,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:03:01,089 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:03:01,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:03:01,824 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:03:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01 WrapperNode [2019-09-07 19:03:01,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:03:01,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:03:01,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:03:01,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:03:01,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:01,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:01,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:01,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:02,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:02,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:02,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (1/1) ... [2019-09-07 19:03:02,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:03:02,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:03:02,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:03:02,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:03:02,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (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-07 19:03:02,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:03:02,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:03:02,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:03:02,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:03:02,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:03:02,192 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:03:02,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:03:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:03:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:03:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:03:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:03:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:03:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:03:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:03:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:03:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:03:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:03:07,304 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:03:07,305 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:03:07,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:03:07 BoogieIcfgContainer [2019-09-07 19:03:07,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:03:07,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:03:07,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:03:07,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:03:07,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:02:59" (1/3) ... [2019-09-07 19:03:07,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e30c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:03:07, skipping insertion in model container [2019-09-07 19:03:07,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:03:01" (2/3) ... [2019-09-07 19:03:07,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e30c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:03:07, skipping insertion in model container [2019-09-07 19:03:07,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:03:07" (3/3) ... [2019-09-07 19:03:07,324 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label42.c [2019-09-07 19:03:07,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:03:07,352 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:03:07,370 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:03:07,420 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:03:07,420 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:03:07,421 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:03:07,421 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:03:07,421 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:03:07,422 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:03:07,422 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:03:07,422 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:03:07,422 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:03:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 19:03:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 19:03:07,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:07,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:03:07,480 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:07,486 INFO L82 PathProgramCache]: Analyzing trace with hash -957440739, now seen corresponding path program 1 times [2019-09-07 19:03:07,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:07,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:07,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:07,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:07,830 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-07 19:03:07,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:03:07,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:03:07,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:03:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:03:07,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:03:07,855 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 4 states. [2019-09-07 19:03:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:03:17,824 INFO L93 Difference]: Finished difference Result 3230 states and 6251 transitions. [2019-09-07 19:03:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:03:17,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-07 19:03:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:03:17,866 INFO L225 Difference]: With dead ends: 3230 [2019-09-07 19:03:17,866 INFO L226 Difference]: Without dead ends: 2309 [2019-09-07 19:03:17,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-07 19:03:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-09-07 19:03:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2309. [2019-09-07 19:03:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-09-07 19:03:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3659 transitions. [2019-09-07 19:03:18,045 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3659 transitions. Word has length 32 [2019-09-07 19:03:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:03:18,046 INFO L475 AbstractCegarLoop]: Abstraction has 2309 states and 3659 transitions. [2019-09-07 19:03:18,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:03:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3659 transitions. [2019-09-07 19:03:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 19:03:18,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:18,057 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:03:18,058 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:18,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2032955008, now seen corresponding path program 1 times [2019-09-07 19:03:18,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:18,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:18,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:03:18,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:03:18,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:03:18,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:03:18,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:03:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:03:18,284 INFO L87 Difference]: Start difference. First operand 2309 states and 3659 transitions. Second operand 6 states. [2019-09-07 19:03:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:03:25,215 INFO L93 Difference]: Finished difference Result 7051 states and 11329 transitions. [2019-09-07 19:03:25,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:03:25,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-09-07 19:03:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:03:25,248 INFO L225 Difference]: With dead ends: 7051 [2019-09-07 19:03:25,248 INFO L226 Difference]: Without dead ends: 4748 [2019-09-07 19:03:25,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:03:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-09-07 19:03:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4707. [2019-09-07 19:03:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4707 states. [2019-09-07 19:03:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 7109 transitions. [2019-09-07 19:03:25,378 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 7109 transitions. Word has length 112 [2019-09-07 19:03:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:03:25,379 INFO L475 AbstractCegarLoop]: Abstraction has 4707 states and 7109 transitions. [2019-09-07 19:03:25,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:03:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 7109 transitions. [2019-09-07 19:03:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 19:03:25,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:25,383 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:03:25,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1760808284, now seen corresponding path program 1 times [2019-09-07 19:03:25,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:25,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:03:25,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:03:25,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:03:25,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:03:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:03:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:03:25,601 INFO L87 Difference]: Start difference. First operand 4707 states and 7109 transitions. Second operand 6 states. [2019-09-07 19:03:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:03:32,286 INFO L93 Difference]: Finished difference Result 14376 states and 22637 transitions. [2019-09-07 19:03:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:03:32,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-07 19:03:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:03:32,336 INFO L225 Difference]: With dead ends: 14376 [2019-09-07 19:03:32,339 INFO L226 Difference]: Without dead ends: 9675 [2019-09-07 19:03:32,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:03:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9675 states. [2019-09-07 19:03:32,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9675 to 9589. [2019-09-07 19:03:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9589 states. [2019-09-07 19:03:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9589 states to 9589 states and 14232 transitions. [2019-09-07 19:03:32,632 INFO L78 Accepts]: Start accepts. Automaton has 9589 states and 14232 transitions. Word has length 142 [2019-09-07 19:03:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:03:32,635 INFO L475 AbstractCegarLoop]: Abstraction has 9589 states and 14232 transitions. [2019-09-07 19:03:32,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:03:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 9589 states and 14232 transitions. [2019-09-07 19:03:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 19:03:32,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:32,641 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:03:32,641 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash -799256903, now seen corresponding path program 1 times [2019-09-07 19:03:32,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:32,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:03:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:03:32,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:03:32,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:03:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:03:32,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:03:32,874 INFO L87 Difference]: Start difference. First operand 9589 states and 14232 transitions. Second operand 6 states. [2019-09-07 19:03:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:03:41,109 INFO L93 Difference]: Finished difference Result 28296 states and 44546 transitions. [2019-09-07 19:03:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:03:41,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-07 19:03:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:03:41,195 INFO L225 Difference]: With dead ends: 28296 [2019-09-07 19:03:41,195 INFO L226 Difference]: Without dead ends: 18713 [2019-09-07 19:03:41,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:03:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2019-09-07 19:03:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 18628. [2019-09-07 19:03:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-09-07 19:03:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 28758 transitions. [2019-09-07 19:03:41,736 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 28758 transitions. Word has length 145 [2019-09-07 19:03:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:03:41,738 INFO L475 AbstractCegarLoop]: Abstraction has 18628 states and 28758 transitions. [2019-09-07 19:03:41,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:03:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 28758 transitions. [2019-09-07 19:03:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 19:03:41,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:41,742 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:03:41,742 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 847267128, now seen corresponding path program 1 times [2019-09-07 19:03:41,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:41,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:03:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:03:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:03:41,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:03:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:03:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:03:41,895 INFO L87 Difference]: Start difference. First operand 18628 states and 28758 transitions. Second operand 4 states. [2019-09-07 19:03:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:03:50,448 INFO L93 Difference]: Finished difference Result 56030 states and 88368 transitions. [2019-09-07 19:03:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:03:50,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-09-07 19:03:50,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:03:50,593 INFO L225 Difference]: With dead ends: 56030 [2019-09-07 19:03:50,593 INFO L226 Difference]: Without dead ends: 37408 [2019-09-07 19:03:50,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:03:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37408 states. [2019-09-07 19:03:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37408 to 37399. [2019-09-07 19:03:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37399 states. [2019-09-07 19:03:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37399 states to 37399 states and 53116 transitions. [2019-09-07 19:03:51,509 INFO L78 Accepts]: Start accepts. Automaton has 37399 states and 53116 transitions. Word has length 180 [2019-09-07 19:03:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:03:51,510 INFO L475 AbstractCegarLoop]: Abstraction has 37399 states and 53116 transitions. [2019-09-07 19:03:51,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:03:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 37399 states and 53116 transitions. [2019-09-07 19:03:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-07 19:03:51,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:03:51,519 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:03:51,519 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:03:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:03:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1088019991, now seen corresponding path program 1 times [2019-09-07 19:03:51,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:03:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:03:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:51,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:03:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 50 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:03:51,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:03:51,724 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-07 19:03:51,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:03:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:03:52,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:03:52,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:03:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 19:03:52,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:03:52,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:03:52,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:03:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:03:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:03:52,316 INFO L87 Difference]: Start difference. First operand 37399 states and 53116 transitions. Second operand 8 states. [2019-09-07 19:04:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:04:07,277 INFO L93 Difference]: Finished difference Result 141388 states and 216654 transitions. [2019-09-07 19:04:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:04:07,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2019-09-07 19:04:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:04:07,879 INFO L225 Difference]: With dead ends: 141388 [2019-09-07 19:04:07,879 INFO L226 Difference]: Without dead ends: 103995 [2019-09-07 19:04:07,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2019-09-07 19:04:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103995 states. [2019-09-07 19:04:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103995 to 103488. [2019-09-07 19:04:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103488 states. [2019-09-07 19:04:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103488 states to 103488 states and 141041 transitions. [2019-09-07 19:04:13,031 INFO L78 Accepts]: Start accepts. Automaton has 103488 states and 141041 transitions. Word has length 246 [2019-09-07 19:04:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:04:13,031 INFO L475 AbstractCegarLoop]: Abstraction has 103488 states and 141041 transitions. [2019-09-07 19:04:13,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:04:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 103488 states and 141041 transitions. [2019-09-07 19:04:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-09-07 19:04:13,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:04:13,073 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:04:13,073 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:04:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:04:13,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2115545347, now seen corresponding path program 1 times [2019-09-07 19:04:13,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:04:13,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:04:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:04:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:04:13,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:04:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:04:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 181 proven. 187 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 19:04:13,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:04:13,405 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-07 19:04:13,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:04:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:04:13,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:04:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:04:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 460 proven. 2 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-07 19:04:13,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:04:13,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:04:13,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:04:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:04:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:04:13,880 INFO L87 Difference]: Start difference. First operand 103488 states and 141041 transitions. Second operand 9 states. [2019-09-07 19:04:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:04:30,542 INFO L93 Difference]: Finished difference Result 274522 states and 431221 transitions. [2019-09-07 19:04:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:04:30,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 410 [2019-09-07 19:04:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:04:31,624 INFO L225 Difference]: With dead ends: 274522 [2019-09-07 19:04:31,624 INFO L226 Difference]: Without dead ends: 162835 [2019-09-07 19:04:31,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:04:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162835 states. [2019-09-07 19:04:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162835 to 151295. [2019-09-07 19:04:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151295 states. [2019-09-07 19:04:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151295 states to 151295 states and 213686 transitions. [2019-09-07 19:04:37,592 INFO L78 Accepts]: Start accepts. Automaton has 151295 states and 213686 transitions. Word has length 410 [2019-09-07 19:04:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:04:37,593 INFO L475 AbstractCegarLoop]: Abstraction has 151295 states and 213686 transitions. [2019-09-07 19:04:37,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:04:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 151295 states and 213686 transitions. [2019-09-07 19:04:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-09-07 19:04:37,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:04:37,628 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:04:37,628 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:04:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:04:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash -44505192, now seen corresponding path program 1 times [2019-09-07 19:04:37,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:04:37,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:04:37,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:04:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:04:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:04:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:04:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2019-09-07 19:04:38,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:04:38,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:04:38,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:04:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:04:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:04:38,719 INFO L87 Difference]: Start difference. First operand 151295 states and 213686 transitions. Second operand 4 states. [2019-09-07 19:04:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:04:50,061 INFO L93 Difference]: Finished difference Result 359352 states and 522448 transitions. [2019-09-07 19:04:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:04:50,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2019-09-07 19:04:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:04:50,950 INFO L225 Difference]: With dead ends: 359352 [2019-09-07 19:04:50,950 INFO L226 Difference]: Without dead ends: 208830 [2019-09-07 19:04:51,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:04:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208830 states. [2019-09-07 19:04:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208830 to 203433. [2019-09-07 19:04:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203433 states. [2019-09-07 19:05:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203433 states to 203433 states and 289388 transitions. [2019-09-07 19:05:00,442 INFO L78 Accepts]: Start accepts. Automaton has 203433 states and 289388 transitions. Word has length 462 [2019-09-07 19:05:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:05:00,442 INFO L475 AbstractCegarLoop]: Abstraction has 203433 states and 289388 transitions. [2019-09-07 19:05:00,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:05:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 203433 states and 289388 transitions. [2019-09-07 19:05:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-07 19:05:00,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:05:00,513 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:05:00,514 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:05:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:05:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1599753749, now seen corresponding path program 1 times [2019-09-07 19:05:00,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:05:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:05:00,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:05:00,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:05:00,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:05:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:05:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 309 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:05:01,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:05:01,529 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-07 19:05:01,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:05:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:05:01,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:05:01,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:05:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 314 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:05:04,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:05:04,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 19:05:04,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 19:05:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 19:05:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:05:04,772 INFO L87 Difference]: Start difference. First operand 203433 states and 289388 transitions. Second operand 15 states. [2019-09-07 19:05:12,773 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 19:05:14,913 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-09-07 19:05:15,322 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-09-07 19:05:17,697 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-09-07 19:05:17,881 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-07 19:05:21,334 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-07 19:05:22,107 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-07 19:05:22,783 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-07 19:05:23,179 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-07 19:05:23,383 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-07 19:05:25,667 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 19:05:40,295 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-07 19:05:42,966 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 19:05:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:05:56,714 INFO L93 Difference]: Finished difference Result 502963 states and 923916 transitions. [2019-09-07 19:05:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-07 19:05:56,715 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 566 [2019-09-07 19:05:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:05:58,452 INFO L225 Difference]: With dead ends: 502963 [2019-09-07 19:05:58,452 INFO L226 Difference]: Without dead ends: 300303 [2019-09-07 19:05:58,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6520 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2120, Invalid=14392, Unknown=0, NotChecked=0, Total=16512 [2019-09-07 19:05:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300303 states. [2019-09-07 19:06:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300303 to 257311. [2019-09-07 19:06:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257311 states. [2019-09-07 19:06:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257311 states to 257311 states and 366810 transitions. [2019-09-07 19:06:08,631 INFO L78 Accepts]: Start accepts. Automaton has 257311 states and 366810 transitions. Word has length 566 [2019-09-07 19:06:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:06:08,632 INFO L475 AbstractCegarLoop]: Abstraction has 257311 states and 366810 transitions. [2019-09-07 19:06:08,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 19:06:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 257311 states and 366810 transitions. [2019-09-07 19:06:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-09-07 19:06:08,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:06:08,769 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:06:08,769 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:06:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:06:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 977630243, now seen corresponding path program 1 times [2019-09-07 19:06:08,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:06:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:06:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:06:08,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:06:08,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:06:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:06:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-09-07 19:06:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:06:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:06:14,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:06:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:06:14,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:06:14,194 INFO L87 Difference]: Start difference. First operand 257311 states and 366810 transitions. Second operand 4 states. [2019-09-07 19:06:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:06:26,683 INFO L93 Difference]: Finished difference Result 599416 states and 876432 transitions. [2019-09-07 19:06:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:06:26,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 724 [2019-09-07 19:06:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:06:28,870 INFO L225 Difference]: With dead ends: 599416 [2019-09-07 19:06:28,870 INFO L226 Difference]: Without dead ends: 343680 [2019-09-07 19:06:29,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:06:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343680 states. [2019-09-07 19:06:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343680 to 327302. [2019-09-07 19:06:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327302 states. [2019-09-07 19:06:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327302 states to 327302 states and 460813 transitions. [2019-09-07 19:06:43,030 INFO L78 Accepts]: Start accepts. Automaton has 327302 states and 460813 transitions. Word has length 724 [2019-09-07 19:06:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:06:43,031 INFO L475 AbstractCegarLoop]: Abstraction has 327302 states and 460813 transitions. [2019-09-07 19:06:43,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:06:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 327302 states and 460813 transitions. [2019-09-07 19:06:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2019-09-07 19:06:43,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:06:43,214 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:06:43,214 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:06:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:06:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1875632772, now seen corresponding path program 1 times [2019-09-07 19:06:43,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:06:43,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:06:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:06:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:06:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:06:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:06:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 376 proven. 418 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 19:06:46,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:06:46,740 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-07 19:06:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:06:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:06:46,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:06:46,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:06:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2019-09-07 19:06:52,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:06:52,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-09-07 19:06:52,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 19:06:52,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 19:06:52,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:06:52,037 INFO L87 Difference]: Start difference. First operand 327302 states and 460813 transitions. Second operand 14 states. [2019-09-07 19:06:56,508 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-07 19:07:13,101 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-07 19:07:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:07:25,977 INFO L93 Difference]: Finished difference Result 649828 states and 926643 transitions. [2019-09-07 19:07:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 19:07:25,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 836 [2019-09-07 19:07:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:07:28,151 INFO L225 Difference]: With dead ends: 649828 [2019-09-07 19:07:28,151 INFO L226 Difference]: Without dead ends: 341828 [2019-09-07 19:07:28,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 883 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1035, Invalid=4367, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 19:07:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341828 states. [2019-09-07 19:07:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341828 to 332168. [2019-09-07 19:07:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332168 states. [2019-09-07 19:07:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332168 states to 332168 states and 431526 transitions. [2019-09-07 19:07:43,266 INFO L78 Accepts]: Start accepts. Automaton has 332168 states and 431526 transitions. Word has length 836 [2019-09-07 19:07:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:07:43,267 INFO L475 AbstractCegarLoop]: Abstraction has 332168 states and 431526 transitions. [2019-09-07 19:07:43,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 19:07:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 332168 states and 431526 transitions. [2019-09-07 19:07:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2019-09-07 19:07:43,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:07:43,532 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:07:43,532 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:07:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:07:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2119007139, now seen corresponding path program 1 times [2019-09-07 19:07:43,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:07:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:07:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:07:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:07:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:07:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:07:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 100 proven. 483 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2019-09-07 19:07:49,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:07:49,705 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-07 19:07:49,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:07:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:07:49,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 1444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:07:50,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:07:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 918 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-09-07 19:07:50,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:07:50,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:07:50,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:07:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:07:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:07:50,484 INFO L87 Difference]: Start difference. First operand 332168 states and 431526 transitions. Second operand 9 states. [2019-09-07 19:08:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:01,749 INFO L93 Difference]: Finished difference Result 599045 states and 760425 transitions. [2019-09-07 19:08:01,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:08:01,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1084 [2019-09-07 19:08:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:03,446 INFO L225 Difference]: With dead ends: 599045 [2019-09-07 19:08:03,447 INFO L226 Difference]: Without dead ends: 262964 [2019-09-07 19:08:03,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1093 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:08:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262964 states. [2019-09-07 19:08:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262964 to 251035. [2019-09-07 19:08:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251035 states. [2019-09-07 19:08:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251035 states to 251035 states and 286988 transitions. [2019-09-07 19:08:08,883 INFO L78 Accepts]: Start accepts. Automaton has 251035 states and 286988 transitions. Word has length 1084 [2019-09-07 19:08:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:08,884 INFO L475 AbstractCegarLoop]: Abstraction has 251035 states and 286988 transitions. [2019-09-07 19:08:08,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:08:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 251035 states and 286988 transitions. [2019-09-07 19:08:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2019-09-07 19:08:09,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:09,025 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:09,025 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2017815798, now seen corresponding path program 1 times [2019-09-07 19:08:09,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:09,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:09,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 970 proven. 36 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-09-07 19:08:16,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:08:16,108 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:08:16,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:16,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 19:08:16,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:08:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:08:16,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:08:16,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:08:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:08:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1269 backedges. 645 proven. 2 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-09-07 19:08:17,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:08:17,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 5] total 28 [2019-09-07 19:08:17,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 19:08:17,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 19:08:17,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-09-07 19:08:17,722 INFO L87 Difference]: Start difference. First operand 251035 states and 286988 transitions. Second operand 28 states. [2019-09-07 19:08:26,060 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-07 19:08:29,251 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-07 19:08:31,022 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-07 19:08:33,513 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-07 19:08:34,042 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-07 19:08:42,070 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-07 19:08:42,405 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-07 19:08:42,665 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-07 19:08:49,046 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-07 19:08:50,218 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-07 19:08:58,443 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-07 19:09:03,316 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-07 19:09:05,999 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-07 19:09:11,096 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-07 19:09:16,915 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-09-07 19:09:17,174 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2019-09-07 19:09:19,531 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-07 19:09:19,874 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-07 19:09:20,109 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-07 19:09:20,614 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-09-07 19:09:24,590 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-07 19:09:24,742 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 51 [2019-09-07 19:09:26,132 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-07 19:09:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:09:34,980 INFO L93 Difference]: Finished difference Result 595811 states and 680901 transitions. [2019-09-07 19:09:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2019-09-07 19:09:34,981 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1102 [2019-09-07 19:09:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:09:35,806 INFO L225 Difference]: With dead ends: 595811 [2019-09-07 19:09:35,806 INFO L226 Difference]: Without dead ends: 345574 [2019-09-07 19:09:36,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1453 GetRequests, 1177 SyntacticMatches, 2 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32135 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=7995, Invalid=67905, Unknown=0, NotChecked=0, Total=75900 [2019-09-07 19:09:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345574 states. [2019-09-07 19:09:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345574 to 320676. [2019-09-07 19:09:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320676 states. [2019-09-07 19:09:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320676 states to 320676 states and 363362 transitions. [2019-09-07 19:09:50,612 INFO L78 Accepts]: Start accepts. Automaton has 320676 states and 363362 transitions. Word has length 1102 [2019-09-07 19:09:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:09:50,613 INFO L475 AbstractCegarLoop]: Abstraction has 320676 states and 363362 transitions. [2019-09-07 19:09:50,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 19:09:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 320676 states and 363362 transitions. [2019-09-07 19:09:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2019-09-07 19:09:50,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:09:50,765 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:09:50,765 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:09:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:09:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 925355897, now seen corresponding path program 1 times [2019-09-07 19:09:50,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:09:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:09:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 283 proven. 308 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-09-07 19:09:53,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:09:53,386 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-07 19:09:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:53,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:09:53,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:09:53,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:09:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-09-07 19:09:54,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:09:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 19:09:54,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:09:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:09:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:09:54,875 INFO L87 Difference]: Start difference. First operand 320676 states and 363362 transitions. Second operand 11 states. [2019-09-07 19:10:00,756 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 19:10:01,638 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-07 19:10:02,012 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-09-07 19:10:04,539 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-07 19:10:09,625 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-07 19:10:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:14,829 INFO L93 Difference]: Finished difference Result 627936 states and 702669 transitions. [2019-09-07 19:10:14,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 19:10:14,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1049 [2019-09-07 19:10:14,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:15,485 INFO L225 Difference]: With dead ends: 627936 [2019-09-07 19:10:15,485 INFO L226 Difference]: Without dead ends: 308056 [2019-09-07 19:10:15,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1070 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 19:10:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308056 states. [2019-09-07 19:10:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308056 to 301755. [2019-09-07 19:10:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301755 states. [2019-09-07 19:10:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301755 states to 301755 states and 332913 transitions. [2019-09-07 19:10:22,877 INFO L78 Accepts]: Start accepts. Automaton has 301755 states and 332913 transitions. Word has length 1049 [2019-09-07 19:10:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:22,878 INFO L475 AbstractCegarLoop]: Abstraction has 301755 states and 332913 transitions. [2019-09-07 19:10:22,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:10:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 301755 states and 332913 transitions. [2019-09-07 19:10:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-09-07 19:10:22,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:22,979 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:10:22,979 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:22,980 INFO L82 PathProgramCache]: Analyzing trace with hash -462134860, now seen corresponding path program 1 times [2019-09-07 19:10:22,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:22,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:22,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:22,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 344 proven. 152 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2019-09-07 19:10:25,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:10:25,672 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:10:25,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:25,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:10:25,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:10:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 858 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 19:10:26,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:10:26,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:10:26,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:10:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:10:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:10:26,913 INFO L87 Difference]: Start difference. First operand 301755 states and 332913 transitions. Second operand 9 states. [2019-09-07 19:10:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:41,245 INFO L93 Difference]: Finished difference Result 629791 states and 698529 transitions. [2019-09-07 19:10:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:10:41,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1137 [2019-09-07 19:10:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:41,996 INFO L225 Difference]: With dead ends: 629791 [2019-09-07 19:10:41,996 INFO L226 Difference]: Without dead ends: 328834 [2019-09-07 19:10:48,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1142 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:10:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328834 states. [2019-09-07 19:10:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328834 to 304178. [2019-09-07 19:10:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304178 states. [2019-09-07 19:10:52,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304178 states to 304178 states and 331828 transitions. [2019-09-07 19:10:52,126 INFO L78 Accepts]: Start accepts. Automaton has 304178 states and 331828 transitions. Word has length 1137 [2019-09-07 19:10:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:52,126 INFO L475 AbstractCegarLoop]: Abstraction has 304178 states and 331828 transitions. [2019-09-07 19:10:52,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:10:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 304178 states and 331828 transitions. [2019-09-07 19:10:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1147 [2019-09-07 19:10:52,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:52,230 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:10:52,230 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -206138749, now seen corresponding path program 1 times [2019-09-07 19:10:52,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:52,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 394 proven. 272 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-09-07 19:10:55,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:10:55,317 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:10:55,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:55,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:10:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:10:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 917 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-07 19:10:59,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:10:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:10:59,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:10:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:10:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:10:59,785 INFO L87 Difference]: Start difference. First operand 304178 states and 331828 transitions. Second operand 9 states. [2019-09-07 19:11:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:11,222 INFO L93 Difference]: Finished difference Result 632989 states and 691117 transitions. [2019-09-07 19:11:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 19:11:11,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1146 [2019-09-07 19:11:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:11,954 INFO L225 Difference]: With dead ends: 632989 [2019-09-07 19:11:11,954 INFO L226 Difference]: Without dead ends: 329609 [2019-09-07 19:11:12,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1167 GetRequests, 1152 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:11:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329609 states. [2019-09-07 19:11:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329609 to 317537. [2019-09-07 19:11:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317537 states. [2019-09-07 19:11:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317537 states to 317537 states and 339109 transitions. [2019-09-07 19:11:18,172 INFO L78 Accepts]: Start accepts. Automaton has 317537 states and 339109 transitions. Word has length 1146 [2019-09-07 19:11:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:18,172 INFO L475 AbstractCegarLoop]: Abstraction has 317537 states and 339109 transitions. [2019-09-07 19:11:18,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:11:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 317537 states and 339109 transitions. [2019-09-07 19:11:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2019-09-07 19:11:18,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:18,276 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:18,276 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:18,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1539119300, now seen corresponding path program 1 times [2019-09-07 19:11:18,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 19:11:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 19:11:19,114 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 19:11:19,119 INFO L168 Benchmark]: Toolchain (without parser) took 499672.45 ms. Allocated memory was 133.7 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 74.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,120 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2377.18 ms. Allocated memory was 133.7 MB in the beginning and 272.1 MB in the end (delta: 138.4 MB). Free memory was 74.7 MB in the beginning and 185.1 MB in the end (delta: -110.3 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,121 INFO L168 Benchmark]: Boogie Preprocessor took 299.76 ms. Allocated memory is still 272.1 MB. Free memory was 185.1 MB in the beginning and 157.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,122 INFO L168 Benchmark]: RCFGBuilder took 5181.30 ms. Allocated memory was 272.1 MB in the beginning and 364.9 MB in the end (delta: 92.8 MB). Free memory was 157.1 MB in the beginning and 101.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,123 INFO L168 Benchmark]: TraceAbstraction took 491809.53 ms. Allocated memory was 364.9 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-09-07 19:11:19,126 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.53 ms. Allocated memory is still 133.7 MB. Free memory was 106.9 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2377.18 ms. Allocated memory was 133.7 MB in the beginning and 272.1 MB in the end (delta: 138.4 MB). Free memory was 74.7 MB in the beginning and 185.1 MB in the end (delta: -110.3 MB). Peak memory consumption was 115.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 299.76 ms. Allocated memory is still 272.1 MB. Free memory was 185.1 MB in the beginning and 157.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5181.30 ms. Allocated memory was 272.1 MB in the beginning and 364.9 MB in the end (delta: 92.8 MB). Free memory was 157.1 MB in the beginning and 101.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 186.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 491809.53 ms. Allocated memory was 364.9 MB in the beginning and 3.8 GB in the end (delta: 3.4 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...