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/product-lines/elevator_spec9_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:38:54,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:38:54,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:38:54,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:38:54,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:38:54,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:38:54,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:38:54,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:38:54,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:38:54,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:38:54,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:38:54,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:38:54,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:38:54,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:38:54,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:38:54,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:38:54,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:38:54,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:38:54,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:38:54,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:38:54,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:38:54,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:38:54,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:38:54,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:38:54,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:38:54,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:38:54,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:38:54,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:38:54,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:38:54,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:38:54,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:38:54,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:38:54,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:38:54,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:38:54,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:38:54,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:38:54,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:38:54,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:38:54,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:38:54,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:38:54,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:38:54,166 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-02 12:38:54,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:38:54,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:38:54,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:38:54,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:38:54,185 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:38:54,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:38:54,186 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:38:54,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:38:54,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:38:54,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:38:54,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:38:54,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:38:54,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:38:54,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:38:54,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:38:54,188 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:38:54,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:38:54,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:38:54,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:38:54,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:38:54,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:38:54,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:38:54,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:38:54,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:38:54,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:38:54,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:38:54,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:38:54,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:38:54,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:38:54,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:38:54,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:38:54,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:38:54,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:38:54,240 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:38:54,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-02 12:38:54,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8098eaac/9f239ed8234d4f07938c121291afcef8/FLAG13fb29a35 [2019-10-02 12:38:54,969 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:38:54,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product30.cil.c [2019-10-02 12:38:55,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8098eaac/9f239ed8234d4f07938c121291afcef8/FLAG13fb29a35 [2019-10-02 12:38:55,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8098eaac/9f239ed8234d4f07938c121291afcef8 [2019-10-02 12:38:55,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:38:55,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:38:55,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:38:55,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:38:55,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:38:55,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:55" (1/1) ... [2019-10-02 12:38:55,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283534bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:55, skipping insertion in model container [2019-10-02 12:38:55,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:38:55" (1/1) ... [2019-10-02 12:38:55,167 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:38:55,260 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:38:56,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:38:56,157 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:38:56,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:38:56,339 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:38:56,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56 WrapperNode [2019-10-02 12:38:56,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:38:56,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:38:56,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:38:56,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:38:56,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (1/1) ... [2019-10-02 12:38:56,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:38:56,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:38:56,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:38:56,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:38:56,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (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-02 12:38:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:38:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:38:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:38:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:38:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:38:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:38:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:38:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:38:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:38:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:38:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:38:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:38:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:38:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:38:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:38:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:38:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:38:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:38:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:38:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:38:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:38:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:38:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:38:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:38:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:38:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:38:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:38:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:38:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:38:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:38:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-02 12:38:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:38:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:38:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:38:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:38:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:38:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:38:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:38:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:38:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:38:56,645 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:38:56,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:38:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:38:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:38:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:38:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:38:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:38:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:38:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:38:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:38:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:38:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:38:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:38:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:38:56,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:38:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:38:56,652 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:38:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:38:56,655 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:38:56,656 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:38:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:38:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:38:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:38:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:38:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:38:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:38:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:38:59,164 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:38:59,165 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:38:59,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:59 BoogieIcfgContainer [2019-10-02 12:38:59,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:38:59,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:38:59,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:38:59,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:38:59,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:38:55" (1/3) ... [2019-10-02 12:38:59,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:59, skipping insertion in model container [2019-10-02 12:38:59,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:38:56" (2/3) ... [2019-10-02 12:38:59,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed5994f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:38:59, skipping insertion in model container [2019-10-02 12:38:59,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:38:59" (3/3) ... [2019-10-02 12:38:59,176 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2019-10-02 12:38:59,187 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:38:59,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:38:59,218 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:38:59,264 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:38:59,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:38:59,265 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:38:59,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:38:59,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:38:59,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:38:59,265 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:38:59,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:38:59,266 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:38:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-10-02 12:38:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 12:38:59,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:59,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:38:59,327 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash 236945449, now seen corresponding path program 1 times [2019-10-02 12:38:59,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:59,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:59,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:59,977 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-02 12:38:59,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:59,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:38:59,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:38:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:38:59,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:00,001 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 4 states. [2019-10-02 12:39:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:00,251 INFO L93 Difference]: Finished difference Result 1241 states and 1999 transitions. [2019-10-02 12:39:00,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:00,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-02 12:39:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:00,289 INFO L225 Difference]: With dead ends: 1241 [2019-10-02 12:39:00,290 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:39:00,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:39:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:39:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:39:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-10-02 12:39:00,462 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 87 [2019-10-02 12:39:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:00,463 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-10-02 12:39:00,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-10-02 12:39:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:39:00,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:00,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:00,479 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:00,480 INFO L82 PathProgramCache]: Analyzing trace with hash -217065445, now seen corresponding path program 1 times [2019-10-02 12:39:00,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:00,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:00,745 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-02 12:39:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:00,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:00,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:00,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:00,748 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-10-02 12:39:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:00,837 INFO L93 Difference]: Finished difference Result 1221 states and 1960 transitions. [2019-10-02 12:39:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:00,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:39:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:00,845 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:39:00,846 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:39:00,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:39:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:39:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:39:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-10-02 12:39:00,901 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 90 [2019-10-02 12:39:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:00,905 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-10-02 12:39:00,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-10-02 12:39:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:39:00,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:00,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:00,911 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1176241356, now seen corresponding path program 1 times [2019-10-02 12:39:00,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:00,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:00,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:01,066 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-02 12:39:01,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:01,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:01,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:01,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:01,069 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-10-02 12:39:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:01,142 INFO L93 Difference]: Finished difference Result 1221 states and 1959 transitions. [2019-10-02 12:39:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:01,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:39:01,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:01,150 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:39:01,150 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:39:01,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:39:01,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:39:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:39:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-10-02 12:39:01,190 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 91 [2019-10-02 12:39:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:01,190 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-10-02 12:39:01,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-10-02 12:39:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:39:01,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:01,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:01,193 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash 21534647, now seen corresponding path program 1 times [2019-10-02 12:39:01,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:01,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:01,363 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-02 12:39:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:01,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:01,366 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 4 states. [2019-10-02 12:39:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:01,453 INFO L93 Difference]: Finished difference Result 1221 states and 1958 transitions. [2019-10-02 12:39:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:01,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:39:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:01,469 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:39:01,469 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:39:01,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:39:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:39:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:39:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 998 transitions. [2019-10-02 12:39:01,502 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 998 transitions. Word has length 92 [2019-10-02 12:39:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:01,503 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 998 transitions. [2019-10-02 12:39:01,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 998 transitions. [2019-10-02 12:39:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:39:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:01,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:01,511 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -634656752, now seen corresponding path program 1 times [2019-10-02 12:39:01,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:01,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:01,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:01,654 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-02 12:39:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:01,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:01,656 INFO L87 Difference]: Start difference. First operand 629 states and 998 transitions. Second operand 4 states. [2019-10-02 12:39:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:01,714 INFO L93 Difference]: Finished difference Result 1221 states and 1957 transitions. [2019-10-02 12:39:01,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:01,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-02 12:39:01,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:01,720 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:39:01,720 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:39:01,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:39:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:39:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:39:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 997 transitions. [2019-10-02 12:39:01,746 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 997 transitions. Word has length 93 [2019-10-02 12:39:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:01,746 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 997 transitions. [2019-10-02 12:39:01,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 997 transitions. [2019-10-02 12:39:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:39:01,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:01,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:01,749 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1365704531, now seen corresponding path program 1 times [2019-10-02 12:39:01,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:01,923 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-02 12:39:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:01,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:01,925 INFO L87 Difference]: Start difference. First operand 629 states and 997 transitions. Second operand 10 states. [2019-10-02 12:39:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:02,115 INFO L93 Difference]: Finished difference Result 1179 states and 1877 transitions. [2019-10-02 12:39:02,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:02,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-02 12:39:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:02,124 INFO L225 Difference]: With dead ends: 1179 [2019-10-02 12:39:02,124 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:39:02,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:39:02,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:39:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-10-02 12:39:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:39:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1006 transitions. [2019-10-02 12:39:02,189 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1006 transitions. Word has length 94 [2019-10-02 12:39:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:02,190 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1006 transitions. [2019-10-02 12:39:02,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1006 transitions. [2019-10-02 12:39:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:39:02,195 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:02,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:02,195 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -564914574, now seen corresponding path program 1 times [2019-10-02 12:39:02,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:02,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:02,369 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-02 12:39:02,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:02,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:02,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:02,371 INFO L87 Difference]: Start difference. First operand 636 states and 1006 transitions. Second operand 4 states. [2019-10-02 12:39:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:02,427 INFO L93 Difference]: Finished difference Result 1227 states and 1963 transitions. [2019-10-02 12:39:02,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:02,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 12:39:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:02,433 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:39:02,433 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:39:02,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 12:39:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:39:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:39:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:39:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 983 transitions. [2019-10-02 12:39:02,462 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 983 transitions. Word has length 94 [2019-10-02 12:39:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:02,462 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 983 transitions. [2019-10-02 12:39:02,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 983 transitions. [2019-10-02 12:39:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:39:02,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:02,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:02,465 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash -811237728, now seen corresponding path program 1 times [2019-10-02 12:39:02,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:02,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:02,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:02,593 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-02 12:39:02,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:02,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:02,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:02,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:02,596 INFO L87 Difference]: Start difference. First operand 623 states and 983 transitions. Second operand 6 states. [2019-10-02 12:39:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:02,819 INFO L93 Difference]: Finished difference Result 1167 states and 1855 transitions. [2019-10-02 12:39:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:02,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:39:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:02,825 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 12:39:02,826 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:39:02,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:39:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:39:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:39:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 979 transitions. [2019-10-02 12:39:02,851 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 979 transitions. Word has length 95 [2019-10-02 12:39:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:02,851 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 979 transitions. [2019-10-02 12:39:02,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 979 transitions. [2019-10-02 12:39:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:39:02,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:02,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:02,854 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1457329514, now seen corresponding path program 1 times [2019-10-02 12:39:02,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:02,990 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-02 12:39:02,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:02,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:02,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:02,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:02,992 INFO L87 Difference]: Start difference. First operand 623 states and 979 transitions. Second operand 6 states. [2019-10-02 12:39:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:03,252 INFO L93 Difference]: Finished difference Result 1167 states and 1851 transitions. [2019-10-02 12:39:03,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:03,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:39:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:03,260 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 12:39:03,260 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:39:03,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:39:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:39:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:39:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 975 transitions. [2019-10-02 12:39:03,388 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 975 transitions. Word has length 96 [2019-10-02 12:39:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:03,390 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 975 transitions. [2019-10-02 12:39:03,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 975 transitions. [2019-10-02 12:39:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:39:03,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:03,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:03,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1359647269, now seen corresponding path program 1 times [2019-10-02 12:39:03,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:03,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:03,532 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-02 12:39:03,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:03,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:03,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:03,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:03,534 INFO L87 Difference]: Start difference. First operand 623 states and 975 transitions. Second operand 6 states. [2019-10-02 12:39:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:03,707 INFO L93 Difference]: Finished difference Result 1167 states and 1847 transitions. [2019-10-02 12:39:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:03,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:39:03,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:03,712 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 12:39:03,713 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:39:03,716 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:39:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:39:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:39:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 971 transitions. [2019-10-02 12:39:03,736 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 971 transitions. Word has length 97 [2019-10-02 12:39:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:03,736 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 971 transitions. [2019-10-02 12:39:03,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 971 transitions. [2019-10-02 12:39:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:39:03,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:03,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:03,738 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -969773403, now seen corresponding path program 1 times [2019-10-02 12:39:03,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:03,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:03,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:03,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:03,862 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-02 12:39:03,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:03,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:03,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:03,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:03,863 INFO L87 Difference]: Start difference. First operand 623 states and 971 transitions. Second operand 7 states. [2019-10-02 12:39:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:03,951 INFO L93 Difference]: Finished difference Result 1167 states and 1843 transitions. [2019-10-02 12:39:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:03,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-02 12:39:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:03,956 INFO L225 Difference]: With dead ends: 1167 [2019-10-02 12:39:03,956 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:39:03,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:39:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:39:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:39:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-10-02 12:39:03,988 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 97 [2019-10-02 12:39:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:03,989 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-10-02 12:39:03,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-10-02 12:39:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:39:03,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:03,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:03,991 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:03,991 INFO L82 PathProgramCache]: Analyzing trace with hash -137400005, now seen corresponding path program 1 times [2019-10-02 12:39:03,991 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:03,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:03,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:03,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:03,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:04,127 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-02 12:39:04,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:04,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:04,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:04,130 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 6 states. [2019-10-02 12:39:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:04,224 INFO L93 Difference]: Finished difference Result 1146 states and 1809 transitions. [2019-10-02 12:39:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:04,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-02 12:39:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:04,230 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:39:04,230 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:39:04,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:39:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:39:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:39:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-10-02 12:39:04,253 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 98 [2019-10-02 12:39:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:04,255 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-10-02 12:39:04,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-10-02 12:39:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:39:04,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:04,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:04,257 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2069760426, now seen corresponding path program 1 times [2019-10-02 12:39:04,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:04,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:04,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:04,388 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-02 12:39:04,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:04,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:04,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:04,391 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 6 states. [2019-10-02 12:39:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:04,537 INFO L93 Difference]: Finished difference Result 1146 states and 1808 transitions. [2019-10-02 12:39:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:04,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:39:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:04,544 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 12:39:04,544 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:39:04,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:39:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:39:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:39:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:39:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 935 transitions. [2019-10-02 12:39:04,570 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 935 transitions. Word has length 99 [2019-10-02 12:39:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:04,571 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 935 transitions. [2019-10-02 12:39:04,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 935 transitions. [2019-10-02 12:39:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 12:39:04,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:04,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:04,574 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1151724576, now seen corresponding path program 1 times [2019-10-02 12:39:04,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:04,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:04,815 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-02 12:39:04,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:39:04,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:04,817 INFO L87 Difference]: Start difference. First operand 602 states and 935 transitions. Second operand 12 states. [2019-10-02 12:39:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:05,036 INFO L93 Difference]: Finished difference Result 1147 states and 1807 transitions. [2019-10-02 12:39:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:39:05,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-02 12:39:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:05,041 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:39:05,041 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 12:39:05,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 12:39:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 12:39:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 12:39:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 934 transitions. [2019-10-02 12:39:05,073 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 934 transitions. Word has length 100 [2019-10-02 12:39:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:05,074 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 934 transitions. [2019-10-02 12:39:05,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 934 transitions. [2019-10-02 12:39:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 12:39:05,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:05,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:05,076 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 196339579, now seen corresponding path program 1 times [2019-10-02 12:39:05,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:05,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:05,261 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-02 12:39:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:05,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:05,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:05,262 INFO L87 Difference]: Start difference. First operand 602 states and 934 transitions. Second operand 10 states. [2019-10-02 12:39:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:11,375 INFO L93 Difference]: Finished difference Result 1776 states and 2866 transitions. [2019-10-02 12:39:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:11,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-10-02 12:39:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:11,389 INFO L225 Difference]: With dead ends: 1776 [2019-10-02 12:39:11,390 INFO L226 Difference]: Without dead ends: 1240 [2019-10-02 12:39:11,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-10-02 12:39:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1210. [2019-10-02 12:39:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-02 12:39:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1927 transitions. [2019-10-02 12:39:11,481 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1927 transitions. Word has length 101 [2019-10-02 12:39:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:11,482 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1927 transitions. [2019-10-02 12:39:11,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1927 transitions. [2019-10-02 12:39:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 12:39:11,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:11,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:11,485 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 994116260, now seen corresponding path program 1 times [2019-10-02 12:39:11,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:11,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:11,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:11,698 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-02 12:39:11,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:11,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:11,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:11,702 INFO L87 Difference]: Start difference. First operand 1210 states and 1927 transitions. Second operand 10 states. [2019-10-02 12:39:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:18,019 INFO L93 Difference]: Finished difference Result 3773 states and 6220 transitions. [2019-10-02 12:39:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:18,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-10-02 12:39:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:18,043 INFO L225 Difference]: With dead ends: 3773 [2019-10-02 12:39:18,044 INFO L226 Difference]: Without dead ends: 2629 [2019-10-02 12:39:18,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-10-02 12:39:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2588. [2019-10-02 12:39:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2019-10-02 12:39:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 4209 transitions. [2019-10-02 12:39:18,210 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 4209 transitions. Word has length 102 [2019-10-02 12:39:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:18,211 INFO L475 AbstractCegarLoop]: Abstraction has 2588 states and 4209 transitions. [2019-10-02 12:39:18,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 4209 transitions. [2019-10-02 12:39:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 12:39:18,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:18,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:18,214 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash 800793247, now seen corresponding path program 1 times [2019-10-02 12:39:18,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:18,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:18,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:18,400 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-02 12:39:18,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:18,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:18,402 INFO L87 Difference]: Start difference. First operand 2588 states and 4209 transitions. Second operand 10 states. [2019-10-02 12:39:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:24,841 INFO L93 Difference]: Finished difference Result 8393 states and 14151 transitions. [2019-10-02 12:39:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:24,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-10-02 12:39:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:24,890 INFO L225 Difference]: With dead ends: 8393 [2019-10-02 12:39:24,890 INFO L226 Difference]: Without dead ends: 5871 [2019-10-02 12:39:24,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-02 12:39:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5808. [2019-10-02 12:39:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5808 states. [2019-10-02 12:39:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9647 transitions. [2019-10-02 12:39:25,373 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9647 transitions. Word has length 103 [2019-10-02 12:39:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:25,373 INFO L475 AbstractCegarLoop]: Abstraction has 5808 states and 9647 transitions. [2019-10-02 12:39:25,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9647 transitions. [2019-10-02 12:39:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 12:39:25,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:25,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:25,377 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -51849208, now seen corresponding path program 1 times [2019-10-02 12:39:25,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:25,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:25,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:25,580 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-02 12:39:25,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:25,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:25,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:25,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:25,582 INFO L87 Difference]: Start difference. First operand 5808 states and 9647 transitions. Second operand 10 states. [2019-10-02 12:39:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:32,220 INFO L93 Difference]: Finished difference Result 19480 states and 33792 transitions. [2019-10-02 12:39:32,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:32,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-10-02 12:39:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:32,338 INFO L225 Difference]: With dead ends: 19480 [2019-10-02 12:39:32,338 INFO L226 Difference]: Without dead ends: 13738 [2019-10-02 12:39:32,388 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2019-10-02 12:39:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13631. [2019-10-02 12:39:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13631 states. [2019-10-02 12:39:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13631 states to 13631 states and 23218 transitions. [2019-10-02 12:39:33,170 INFO L78 Accepts]: Start accepts. Automaton has 13631 states and 23218 transitions. Word has length 104 [2019-10-02 12:39:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:33,171 INFO L475 AbstractCegarLoop]: Abstraction has 13631 states and 23218 transitions. [2019-10-02 12:39:33,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 13631 states and 23218 transitions. [2019-10-02 12:39:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 12:39:33,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:33,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:33,173 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash 131442115, now seen corresponding path program 1 times [2019-10-02 12:39:33,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:33,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:33,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:33,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:33,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-02 12:39:33,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:33,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:33,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:33,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:33,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:33,335 INFO L87 Difference]: Start difference. First operand 13631 states and 23218 transitions. Second operand 10 states. [2019-10-02 12:39:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:42,364 INFO L93 Difference]: Finished difference Result 47341 states and 85381 transitions. [2019-10-02 12:39:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:42,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-10-02 12:39:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:42,694 INFO L225 Difference]: With dead ends: 47341 [2019-10-02 12:39:42,694 INFO L226 Difference]: Without dead ends: 33776 [2019-10-02 12:39:42,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33776 states. [2019-10-02 12:39:44,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33776 to 33581. [2019-10-02 12:39:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33581 states. [2019-10-02 12:39:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33581 states to 33581 states and 59124 transitions. [2019-10-02 12:39:44,837 INFO L78 Accepts]: Start accepts. Automaton has 33581 states and 59124 transitions. Word has length 105 [2019-10-02 12:39:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:44,838 INFO L475 AbstractCegarLoop]: Abstraction has 33581 states and 59124 transitions. [2019-10-02 12:39:44,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33581 states and 59124 transitions. [2019-10-02 12:39:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 12:39:44,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:44,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:39:44,840 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1931057812, now seen corresponding path program 1 times [2019-10-02 12:39:44,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:44,987 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-02 12:39:44,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:44,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:44,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:44,989 INFO L87 Difference]: Start difference. First operand 33581 states and 59124 transitions. Second operand 10 states. [2019-10-02 12:39:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:55,203 INFO L93 Difference]: Finished difference Result 121370 states and 231075 transitions. [2019-10-02 12:39:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:55,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-10-02 12:39:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:55,950 INFO L225 Difference]: With dead ends: 121370 [2019-10-02 12:39:55,950 INFO L226 Difference]: Without dead ends: 87855 [2019-10-02 12:39:56,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87855 states. [2019-10-02 12:40:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87855 to 87484. [2019-10-02 12:40:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87484 states. [2019-10-02 12:40:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87484 states to 87484 states and 161257 transitions. [2019-10-02 12:40:06,623 INFO L78 Accepts]: Start accepts. Automaton has 87484 states and 161257 transitions. Word has length 106 [2019-10-02 12:40:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:06,624 INFO L475 AbstractCegarLoop]: Abstraction has 87484 states and 161257 transitions. [2019-10-02 12:40:06,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:40:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87484 states and 161257 transitions. [2019-10-02 12:40:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 12:40:06,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:06,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:40:06,626 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1719706899, now seen corresponding path program 1 times [2019-10-02 12:40:06,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:06,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:06,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:06,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:06,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:06,719 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-02 12:40:06,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:06,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:40:06,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:40:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:40:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:06,721 INFO L87 Difference]: Start difference. First operand 87484 states and 161257 transitions. Second operand 3 states. [2019-10-02 12:40:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:17,463 INFO L93 Difference]: Finished difference Result 262311 states and 530894 transitions. [2019-10-02 12:40:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:40:17,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-02 12:40:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:19,252 INFO L225 Difference]: With dead ends: 262311 [2019-10-02 12:40:19,252 INFO L226 Difference]: Without dead ends: 174893 [2019-10-02 12:40:20,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174893 states. [2019-10-02 12:40:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174893 to 174891. [2019-10-02 12:40:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174891 states. [2019-10-02 12:40:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174891 states to 174891 states and 361450 transitions. [2019-10-02 12:40:41,432 INFO L78 Accepts]: Start accepts. Automaton has 174891 states and 361450 transitions. Word has length 106 [2019-10-02 12:40:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:41,433 INFO L475 AbstractCegarLoop]: Abstraction has 174891 states and 361450 transitions. [2019-10-02 12:40:41,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:40:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 174891 states and 361450 transitions. [2019-10-02 12:40:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 12:40:41,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:41,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:40:41,435 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:41,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1772620946, now seen corresponding path program 1 times [2019-10-02 12:40:41,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:41,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:41,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:41,535 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-02 12:40:41,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:40:41,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:40:41,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:40:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:40:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:40:41,536 INFO L87 Difference]: Start difference. First operand 174891 states and 361450 transitions. Second operand 3 states. [2019-10-02 12:41:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:41:18,385 INFO L93 Difference]: Finished difference Result 524534 states and 1235338 transitions. [2019-10-02 12:41:18,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:41:18,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-02 12:41:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:41:22,196 INFO L225 Difference]: With dead ends: 524534 [2019-10-02 12:41:22,197 INFO L226 Difference]: Without dead ends: 349709 [2019-10-02 12:41:23,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:41:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349709 states. [2019-10-02 12:41:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349709 to 349706. [2019-10-02 12:41:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349706 states. [2019-10-02 12:42:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349706 states to 349706 states and 845156 transitions. [2019-10-02 12:42:17,356 INFO L78 Accepts]: Start accepts. Automaton has 349706 states and 845156 transitions. Word has length 107 [2019-10-02 12:42:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:42:17,356 INFO L475 AbstractCegarLoop]: Abstraction has 349706 states and 845156 transitions. [2019-10-02 12:42:17,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:42:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 349706 states and 845156 transitions. [2019-10-02 12:42:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 12:42:17,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:42:17,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:42:17,359 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:42:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:42:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 882014799, now seen corresponding path program 1 times [2019-10-02 12:42:17,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:42:17,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:42:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:17,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:42:17,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:42:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:42:17,460 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-02 12:42:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:42:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:42:17,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:42:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:42:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:42:17,462 INFO L87 Difference]: Start difference. First operand 349706 states and 845156 transitions. Second operand 3 states.