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/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:16:06,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:16:06,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:16:06,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:16:06,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:16:06,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:16:06,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:16:06,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:16:06,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:16:06,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:16:06,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:16:06,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:16:06,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:16:06,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:16:06,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:16:06,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:16:06,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:16:06,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:16:06,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:16:06,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:16:06,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:16:06,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:16:06,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:16:06,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:16:06,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:16:06,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:16:06,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:16:06,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:16:06,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:16:06,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:16:06,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:16:06,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:16:06,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:16:06,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:16:06,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:16:06,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:16:06,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:16:06,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:16:06,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:16:06,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:16:06,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:16:06,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:16:06,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:16:06,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:16:06,528 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:16:06,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:16:06,529 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:16:06,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:16:06,529 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:16:06,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:16:06,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:16:06,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:16:06,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:16:06,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:16:06,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:16:06,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:16:06,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:16:06,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:16:06,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:16:06,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:16:06,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:16:06,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:16:06,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:16:06,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:16:06,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:16:06,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:16:06,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:16:06,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:16:06,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:16:06,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:16:06,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:16:06,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:16:06,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:16:06,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:16:06,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:16:06,828 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:16:06,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-13 19:16:06,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c772f462/aba4b8ac220544feb35ad8c521dadc4b/FLAG77d5b7a7e [2019-10-13 19:16:07,319 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:16:07,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-13 19:16:07,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c772f462/aba4b8ac220544feb35ad8c521dadc4b/FLAG77d5b7a7e [2019-10-13 19:16:07,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c772f462/aba4b8ac220544feb35ad8c521dadc4b [2019-10-13 19:16:07,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:16:07,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:16:07,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:07,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:16:07,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:16:07,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:07" (1/1) ... [2019-10-13 19:16:07,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da11249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:07, skipping insertion in model container [2019-10-13 19:16:07,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:16:07" (1/1) ... [2019-10-13 19:16:07,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:16:07,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:16:07,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:07,972 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:16:08,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:16:08,111 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:16:08,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08 WrapperNode [2019-10-13 19:16:08,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:16:08,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:16:08,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:16:08,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:16:08,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... [2019-10-13 19:16:08,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:16:08,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:16:08,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:16:08,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:16:08,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:16:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:16:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:16:08,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:16:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:16:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:16:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 19:16:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:16:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:16:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:16:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:16:08,556 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:16:08,556 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:16:08,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:08 BoogieIcfgContainer [2019-10-13 19:16:08,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:16:08,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:16:08,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:16:08,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:16:08,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:16:07" (1/3) ... [2019-10-13 19:16:08,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e851d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:08, skipping insertion in model container [2019-10-13 19:16:08,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:16:08" (2/3) ... [2019-10-13 19:16:08,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e851d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:16:08, skipping insertion in model container [2019-10-13 19:16:08,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:16:08" (3/3) ... [2019-10-13 19:16:08,565 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-10-13 19:16:08,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:16:08,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-13 19:16:08,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-13 19:16:08,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:16:08,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:16:08,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:16:08,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:16:08,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:16:08,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:16:08,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:16:08,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:16:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-13 19:16:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:16:08,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:08,641 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:08,643 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-10-13 19:16:08,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:08,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977614223] [2019-10-13 19:16:08,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:08,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:08,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977614223] [2019-10-13 19:16:08,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:08,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:16:08,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7729338] [2019-10-13 19:16:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:16:08,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:08,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:16:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:16:08,855 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-10-13 19:16:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:09,060 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2019-10-13 19:16:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:09,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 19:16:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:09,076 INFO L225 Difference]: With dead ends: 90 [2019-10-13 19:16:09,077 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 19:16:09,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 19:16:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-10-13 19:16:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 19:16:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-13 19:16:09,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-10-13 19:16:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:09,146 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-13 19:16:09,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:16:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-13 19:16:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:16:09,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:09,150 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:09,152 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-10-13 19:16:09,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:09,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492904126] [2019-10-13 19:16:09,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:09,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492904126] [2019-10-13 19:16:09,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:09,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:09,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695022590] [2019-10-13 19:16:09,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:09,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:09,236 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-10-13 19:16:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:09,512 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-10-13 19:16:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:09,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 19:16:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:09,515 INFO L225 Difference]: With dead ends: 153 [2019-10-13 19:16:09,515 INFO L226 Difference]: Without dead ends: 101 [2019-10-13 19:16:09,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-13 19:16:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-10-13 19:16:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 19:16:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-13 19:16:09,541 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-10-13 19:16:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:09,541 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-13 19:16:09,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-13 19:16:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:16:09,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:09,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:09,543 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-10-13 19:16:09,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:09,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289974083] [2019-10-13 19:16:09,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:09,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289974083] [2019-10-13 19:16:09,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:09,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:09,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858609024] [2019-10-13 19:16:09,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:09,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:09,641 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-10-13 19:16:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:09,741 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-10-13 19:16:09,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:09,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 19:16:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:09,743 INFO L225 Difference]: With dead ends: 75 [2019-10-13 19:16:09,744 INFO L226 Difference]: Without dead ends: 73 [2019-10-13 19:16:09,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-13 19:16:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-10-13 19:16:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 19:16:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-13 19:16:09,752 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-10-13 19:16:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:09,752 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-13 19:16:09,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-13 19:16:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 19:16:09,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:09,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:09,754 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-10-13 19:16:09,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:09,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825905087] [2019-10-13 19:16:09,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:09,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825905087] [2019-10-13 19:16:09,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:09,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:09,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731073092] [2019-10-13 19:16:09,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:09,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:09,805 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-10-13 19:16:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:09,950 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-10-13 19:16:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:09,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 19:16:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:09,952 INFO L225 Difference]: With dead ends: 96 [2019-10-13 19:16:09,952 INFO L226 Difference]: Without dead ends: 94 [2019-10-13 19:16:09,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-13 19:16:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-10-13 19:16:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:16:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 19:16:09,960 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-10-13 19:16:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:09,960 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 19:16:09,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 19:16:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:09,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:09,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:09,962 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-10-13 19:16:09,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:09,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42927411] [2019-10-13 19:16:09,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:09,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:10,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42927411] [2019-10-13 19:16:10,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:10,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:10,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507375128] [2019-10-13 19:16:10,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:10,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:10,044 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2019-10-13 19:16:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:10,239 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-10-13 19:16:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:10,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-13 19:16:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:10,241 INFO L225 Difference]: With dead ends: 95 [2019-10-13 19:16:10,241 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:16:10,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:16:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:16:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-10-13 19:16:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:16:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-13 19:16:10,255 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-10-13 19:16:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:10,256 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-13 19:16:10,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-13 19:16:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:16:10,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:10,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:10,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-10-13 19:16:10,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:10,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071244902] [2019-10-13 19:16:10,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:10,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071244902] [2019-10-13 19:16:10,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:10,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:10,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859545366] [2019-10-13 19:16:10,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:10,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:10,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:10,335 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-10-13 19:16:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:10,464 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-13 19:16:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:10,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:16:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:10,466 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:10,466 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:10,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-10-13 19:16:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 19:16:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-13 19:16:10,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-13 19:16:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:10,475 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-13 19:16:10,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-13 19:16:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:10,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:10,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:10,477 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:10,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-10-13 19:16:10,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:10,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533928642] [2019-10-13 19:16:10,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:10,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533928642] [2019-10-13 19:16:10,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:10,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:10,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889565669] [2019-10-13 19:16:10,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:10,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:10,559 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-10-13 19:16:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:10,696 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-10-13 19:16:10,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:10,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 19:16:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:10,698 INFO L225 Difference]: With dead ends: 91 [2019-10-13 19:16:10,698 INFO L226 Difference]: Without dead ends: 89 [2019-10-13 19:16:10,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-13 19:16:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-10-13 19:16:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 19:16:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-13 19:16:10,714 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-10-13 19:16:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:10,714 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-13 19:16:10,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:10,714 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-13 19:16:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:16:10,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:10,716 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:10,717 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:10,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-10-13 19:16:10,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:10,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938093571] [2019-10-13 19:16:10,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:10,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:10,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938093571] [2019-10-13 19:16:10,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:10,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:10,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665824516] [2019-10-13 19:16:10,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:10,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:10,796 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-10-13 19:16:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:10,987 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-10-13 19:16:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:10,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:16:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:10,989 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:16:10,989 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 19:16:10,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:16:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 19:16:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-10-13 19:16:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:16:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-13 19:16:11,001 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-10-13 19:16:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:11,001 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-13 19:16:11,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-13 19:16:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:16:11,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:11,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:11,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-10-13 19:16:11,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:11,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33296914] [2019-10-13 19:16:11,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:11,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33296914] [2019-10-13 19:16:11,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:11,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:11,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452389280] [2019-10-13 19:16:11,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:11,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:11,098 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2019-10-13 19:16:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:11,228 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-13 19:16:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:11,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-13 19:16:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:11,230 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:16:11,230 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 19:16:11,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:16:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 19:16:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-10-13 19:16:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 19:16:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 19:16:11,235 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-10-13 19:16:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:11,236 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 19:16:11,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 19:16:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 19:16:11,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:11,237 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:11,237 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:11,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-10-13 19:16:11,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:11,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429195496] [2019-10-13 19:16:11,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:11,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429195496] [2019-10-13 19:16:11,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:11,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:11,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604759998] [2019-10-13 19:16:11,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:11,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:11,280 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-13 19:16:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:11,352 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-13 19:16:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:16:11,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-13 19:16:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:11,353 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:16:11,353 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 19:16:11,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 19:16:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-10-13 19:16:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:16:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-13 19:16:11,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-10-13 19:16:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:11,358 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-13 19:16:11,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-13 19:16:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 19:16:11,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:11,359 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:11,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-10-13 19:16:11,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:11,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173684164] [2019-10-13 19:16:11,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:11,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173684164] [2019-10-13 19:16:11,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:11,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:16:11,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090008696] [2019-10-13 19:16:11,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:16:11,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:16:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:16:11,400 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-10-13 19:16:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:11,528 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-10-13 19:16:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:11,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-13 19:16:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:11,529 INFO L225 Difference]: With dead ends: 69 [2019-10-13 19:16:11,529 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 19:16:11,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:16:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 19:16:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-10-13 19:16:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 19:16:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-13 19:16:11,546 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-10-13 19:16:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:11,547 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-13 19:16:11,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:16:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-13 19:16:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:16:11,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:11,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:11,548 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-10-13 19:16:11,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:11,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824092917] [2019-10-13 19:16:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:11,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824092917] [2019-10-13 19:16:11,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:11,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:11,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489807788] [2019-10-13 19:16:11,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:11,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:11,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:11,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:11,589 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-10-13 19:16:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:11,748 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-10-13 19:16:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:16:11,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-13 19:16:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:11,750 INFO L225 Difference]: With dead ends: 74 [2019-10-13 19:16:11,750 INFO L226 Difference]: Without dead ends: 72 [2019-10-13 19:16:11,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:16:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-13 19:16:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-10-13 19:16:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 19:16:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-13 19:16:11,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-10-13 19:16:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:11,757 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-13 19:16:11,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-13 19:16:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:16:11,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:11,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:11,759 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-10-13 19:16:11,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:11,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314799521] [2019-10-13 19:16:11,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:11,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:11,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314799521] [2019-10-13 19:16:11,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:11,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:11,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746014289] [2019-10-13 19:16:11,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:11,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:11,832 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-10-13 19:16:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:12,026 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-10-13 19:16:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:12,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-13 19:16:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:12,027 INFO L225 Difference]: With dead ends: 62 [2019-10-13 19:16:12,027 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 19:16:12,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:16:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 19:16:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-10-13 19:16:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 19:16:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 19:16:12,033 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-10-13 19:16:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:12,034 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 19:16:12,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 19:16:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:16:12,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:12,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:12,039 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-10-13 19:16:12,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:12,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701030726] [2019-10-13 19:16:12,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:12,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701030726] [2019-10-13 19:16:12,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:12,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:16:12,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360838016] [2019-10-13 19:16:12,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:16:12,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:16:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:16:12,096 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-13 19:16:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:12,276 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-10-13 19:16:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:16:12,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-13 19:16:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:12,278 INFO L225 Difference]: With dead ends: 87 [2019-10-13 19:16:12,278 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 19:16:12,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:16:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 19:16:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-10-13 19:16:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 19:16:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-13 19:16:12,289 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-10-13 19:16:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:12,290 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-13 19:16:12,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:16:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-13 19:16:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:16:12,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:12,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:12,291 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-10-13 19:16:12,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:12,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185299095] [2019-10-13 19:16:12,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:12,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185299095] [2019-10-13 19:16:12,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:12,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:12,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032956376] [2019-10-13 19:16:12,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:12,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:12,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:12,344 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-10-13 19:16:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:12,527 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-13 19:16:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:12,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-13 19:16:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:12,528 INFO L225 Difference]: With dead ends: 60 [2019-10-13 19:16:12,528 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 19:16:12,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:16:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 19:16:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-10-13 19:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 19:16:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 19:16:12,534 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-10-13 19:16:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:12,534 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 19:16:12,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 19:16:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:16:12,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:16:12,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:16:12,535 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:16:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:16:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-10-13 19:16:12,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:16:12,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100034355] [2019-10-13 19:16:12,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:16:12,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:16:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:16:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:16:12,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100034355] [2019-10-13 19:16:12,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:16:12,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 19:16:12,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856326152] [2019-10-13 19:16:12,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:16:12,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:16:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:16:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:16:12,581 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2019-10-13 19:16:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:16:12,856 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-10-13 19:16:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:16:12,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-13 19:16:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:16:12,858 INFO L225 Difference]: With dead ends: 125 [2019-10-13 19:16:12,858 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:16:12,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:16:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:16:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:16:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:16:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:16:12,860 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-10-13 19:16:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:16:12,860 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:16:12,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:16:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:16:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:16:12,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:16:13,095 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 63 [2019-10-13 19:16:13,313 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 103 [2019-10-13 19:16:13,482 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 66 [2019-10-13 19:16:13,729 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 12 [2019-10-13 19:16:14,122 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-10-13 19:16:14,228 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 22 [2019-10-13 19:16:14,230 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:14,230 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|)) [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 19:16:14,231 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 19:16:14,231 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-10-13 19:16:14,231 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-10-13 19:16:14,232 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-10-13 19:16:14,232 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-10-13 19:16:14,232 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-10-13 19:16:14,232 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-10-13 19:16:14,232 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse3 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse4 (<= 0 main_~main__j~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (= ~__return_334~0 |old(~__return_334~0)|)) (.cse2 (and (<= 1 main_~main__j~0) (let ((.cse5 (and (<= 1 main_~main__i~0) .cse4))) (or (and (not (= main_~__VERIFIER_assert__cond~12 0)) .cse5) (and .cse5 .cse3)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0) .cse0) .cse4) (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1 .cse2)))) [2019-10-13 19:16:14,232 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-10-13 19:16:14,233 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-10-13 19:16:14,234 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: (= ~__return_334~0 |old(~__return_334~0)|) [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-10-13 19:16:14,235 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-10-13 19:16:14,236 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-10-13 19:16:14,236 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-10-13 19:16:14,236 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-10-13 19:16:14,236 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-10-13 19:16:14,236 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 19:16:14,237 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-10-13 19:16:14,238 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= ~__return_334~0 |old(~__return_334~0)|) (<= 0 main_~main__j~0)) [2019-10-13 19:16:14,238 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-10-13 19:16:14,239 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-10-13 19:16:14,240 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-10-13 19:16:14,241 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= ~__return_334~0 |old(~__return_334~0)|)) [2019-10-13 19:16:14,241 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-10-13 19:16:14,241 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-10-13 19:16:14,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:16:14 BoogieIcfgContainer [2019-10-13 19:16:14,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 19:16:14,280 INFO L168 Benchmark]: Toolchain (without parser) took 6563.41 ms. Allocated memory was 144.7 MB in the beginning and 304.6 MB in the end (delta: 159.9 MB). Free memory was 102.7 MB in the beginning and 229.7 MB in the end (delta: -127.0 MB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,281 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.77 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 181.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,283 INFO L168 Benchmark]: Boogie Preprocessor took 32.94 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,287 INFO L168 Benchmark]: RCFGBuilder took 412.10 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 157.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,288 INFO L168 Benchmark]: TraceAbstraction took 5719.44 ms. Allocated memory was 201.9 MB in the beginning and 304.6 MB in the end (delta: 102.8 MB). Free memory was 156.5 MB in the beginning and 229.7 MB in the end (delta: -73.2 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. [2019-10-13 19:16:14,292 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.77 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.5 MB in the beginning and 181.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.94 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 178.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.10 ms. Allocated memory is still 201.9 MB. Free memory was 178.5 MB in the beginning and 157.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5719.44 ms. Allocated memory was 201.9 MB in the beginning and 304.6 MB in the end (delta: 102.8 MB). Free memory was 156.5 MB in the beginning and 229.7 MB in the end (delta: -73.2 MB). Peak memory consumption was 142.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (0 <= main__i && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((main__limit + 4 <= main__bufsize && __return_334 == \old(__return_334)) && 1 <= main__j && ((!(__VERIFIER_assert__cond == 0) && 1 <= main__i && 0 <= main__j) || ((1 <= main__i && 0 <= main__j) && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) || ((__return_334 == \old(__return_334) && (main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j)) || (((!(__VERIFIER_assert__cond == 0) && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334)) && 1 <= main__j && ((!(__VERIFIER_assert__cond == 0) && 1 <= main__i && 0 <= main__j) || ((1 <= main__i && 0 <= main__j) && main__j + 4 <= main__bufsize))) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334)) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Result: SAFE, OverallTime: 5.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 935 SDtfs, 1910 SDslu, 227 SDs, 0 SdLazy, 1420 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 157 HoareAnnotationTreeSize, 7 FomulaSimplifications, 883802412 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 50606 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...