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_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:23:59,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:23:59,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:23:59,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:23:59,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:23:59,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:23:59,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:23:59,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:23:59,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:23:59,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:23:59,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:23:59,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:23:59,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:23:59,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:23:59,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:23:59,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:23:59,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:23:59,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:23:59,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:23:59,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:23:59,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:23:59,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:23:59,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:23:59,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:23:59,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:23:59,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:23:59,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:23:59,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:23:59,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:23:59,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:23:59,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:23:59,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:23:59,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:23:59,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:23:59,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:23:59,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:23:59,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:23:59,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:23:59,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:23:59,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:23:59,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:23:59,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:23:59,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:23:59,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:23:59,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:23:59,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:23:59,639 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:23:59,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:23:59,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:23:59,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:23:59,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:23:59,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:23:59,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:23:59,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:23:59,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:23:59,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:23:59,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:23:59,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:23:59,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:23:59,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:23:59,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:23:59,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:23:59,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:23:59,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:23:59,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:23:59,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:23:59,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:23:59,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:23:59,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:23:59,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:23:59,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:23:59,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:23:59,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:23:59,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:23:59,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:23:59,700 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:23:59,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-09-08 04:23:59,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c268d3e/0b378b25eb364795a415745d52f7c375/FLAG1c43380fc [2019-09-08 04:24:00,496 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:24:00,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product28.cil.c [2019-09-08 04:24:00,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c268d3e/0b378b25eb364795a415745d52f7c375/FLAG1c43380fc [2019-09-08 04:24:00,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89c268d3e/0b378b25eb364795a415745d52f7c375 [2019-09-08 04:24:00,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:24:00,640 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:24:00,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:24:00,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:24:00,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:24:00,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:24:00" (1/1) ... [2019-09-08 04:24:00,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c77ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:00, skipping insertion in model container [2019-09-08 04:24:00,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:24:00" (1/1) ... [2019-09-08 04:24:00,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:24:00,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:24:01,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:24:01,569 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:24:01,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:24:01,735 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:24:01,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01 WrapperNode [2019-09-08 04:24:01,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:24:01,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:24:01,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:24:01,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:24:01,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:01,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... [2019-09-08 04:24:02,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:24:02,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:24:02,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:24:02,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:24:02,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:24:02,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:24:02,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:24:02,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:24:02,085 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:24:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:24:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:24:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:24:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:24:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:24:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:24:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:24:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:24:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:24:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:24:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:24:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:24:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:24:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:24:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:24:02,090 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:24:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:24:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:24:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:24:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:24:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:24:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:24:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:24:02,094 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:24:02,094 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:24:02,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:24:02,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:24:02,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:24:02,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:24:02,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:24:02,096 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:24:02,096 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:24:02,096 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:24:02,096 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:24:02,097 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:24:02,098 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:24:02,098 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:24:02,098 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:24:02,098 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:24:02,098 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:24:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:24:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:24:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:24:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:24:02,099 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:24:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:24:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:24:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:24:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:24:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:24:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:24:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:24:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:24:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:24:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:24:02,102 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:24:02,103 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:24:02,104 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:24:02,105 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:24:02,105 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:24:02,105 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:24:02,105 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:24:02,105 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:24:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:24:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 04:24:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:24:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:24:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:24:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:24:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:24:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:24:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:24:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:24:04,399 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:24:04,399 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:24:04,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:24:04 BoogieIcfgContainer [2019-09-08 04:24:04,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:24:04,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:24:04,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:24:04,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:24:04,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:24:00" (1/3) ... [2019-09-08 04:24:04,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff55e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:24:04, skipping insertion in model container [2019-09-08 04:24:04,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:01" (2/3) ... [2019-09-08 04:24:04,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff55e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:24:04, skipping insertion in model container [2019-09-08 04:24:04,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:24:04" (3/3) ... [2019-09-08 04:24:04,411 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product28.cil.c [2019-09-08 04:24:04,422 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:24:04,432 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:24:04,450 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:24:04,497 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:24:04,498 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:24:04,498 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:24:04,498 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:24:04,498 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:24:04,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:24:04,498 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:24:04,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:24:04,499 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:24:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states. [2019-09-08 04:24:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 04:24:04,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:04,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:04,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 961296188, now seen corresponding path program 1 times [2019-09-08 04:24:04,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:04,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:04,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:05,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:05,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:05,103 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 4 states. [2019-09-08 04:24:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:05,352 INFO L93 Difference]: Finished difference Result 1235 states and 1985 transitions. [2019-09-08 04:24:05,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:05,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 04:24:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:05,395 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 04:24:05,395 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:24:05,409 INFO L628 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-09-08 04:24:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:24:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:24:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:24:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-09-08 04:24:05,586 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 87 [2019-09-08 04:24:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:05,586 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-09-08 04:24:05,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-09-08 04:24:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:24:05,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:05,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:05,593 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:05,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1704388894, now seen corresponding path program 1 times [2019-09-08 04:24:05,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:05,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:05,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:05,829 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 4 states. [2019-09-08 04:24:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:05,945 INFO L93 Difference]: Finished difference Result 1215 states and 1946 transitions. [2019-09-08 04:24:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:05,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:24:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:05,956 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:24:05,956 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:24:05,962 INFO L628 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-09-08 04:24:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:24:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:24:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:24:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-09-08 04:24:06,020 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 90 [2019-09-08 04:24:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:06,021 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-09-08 04:24:06,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-09-08 04:24:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:24:06,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:06,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:06,026 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:06,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:06,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1677160523, now seen corresponding path program 1 times [2019-09-08 04:24:06,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:06,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:06,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:06,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:06,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:06,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:06,175 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 4 states. [2019-09-08 04:24:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:06,263 INFO L93 Difference]: Finished difference Result 1215 states and 1945 transitions. [2019-09-08 04:24:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:06,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:24:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:06,274 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:24:06,274 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:24:06,277 INFO L628 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-09-08 04:24:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:24:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:24:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:24:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-09-08 04:24:06,322 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 91 [2019-09-08 04:24:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-09-08 04:24:06,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-09-08 04:24:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:24:06,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:06,325 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:06,326 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1700539194, now seen corresponding path program 1 times [2019-09-08 04:24:06,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:06,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:06,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:06,555 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 4 states. [2019-09-08 04:24:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:06,664 INFO L93 Difference]: Finished difference Result 1215 states and 1944 transitions. [2019-09-08 04:24:06,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:06,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:24:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:06,673 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:24:06,676 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:24:06,680 INFO L628 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-09-08 04:24:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:24:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:24:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:24:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-09-08 04:24:06,710 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-09-08 04:24:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:06,711 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-09-08 04:24:06,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-09-08 04:24:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:24:06,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:06,715 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:06,715 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1002231129, now seen corresponding path program 1 times [2019-09-08 04:24:06,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:06,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:06,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:06,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:06,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:06,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:06,855 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-09-08 04:24:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:06,913 INFO L93 Difference]: Finished difference Result 1215 states and 1943 transitions. [2019-09-08 04:24:06,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:06,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 04:24:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:06,920 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 04:24:06,921 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:24:06,924 INFO L628 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-09-08 04:24:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:24:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 04:24:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:24:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 990 transitions. [2019-09-08 04:24:06,948 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 990 transitions. Word has length 93 [2019-09-08 04:24:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:06,949 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 990 transitions. [2019-09-08 04:24:06,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 990 transitions. [2019-09-08 04:24:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:24:06,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:06,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:06,953 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1978692950, now seen corresponding path program 1 times [2019-09-08 04:24:06,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:06,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:06,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:06,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:07,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:07,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:07,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:07,148 INFO L87 Difference]: Start difference. First operand 626 states and 990 transitions. Second operand 10 states. [2019-09-08 04:24:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:07,322 INFO L93 Difference]: Finished difference Result 1173 states and 1863 transitions. [2019-09-08 04:24:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:24:07,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 04:24:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:07,327 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 04:24:07,328 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 04:24:07,331 INFO L628 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-09-08 04:24:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 04:24:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-08 04:24:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 04:24:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 999 transitions. [2019-09-08 04:24:07,362 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 999 transitions. Word has length 94 [2019-09-08 04:24:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:07,364 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 999 transitions. [2019-09-08 04:24:07,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 999 transitions. [2019-09-08 04:24:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:24:07,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:07,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:07,370 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash 48073845, now seen corresponding path program 1 times [2019-09-08 04:24:07,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:07,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:07,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:07,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:07,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:07,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:07,502 INFO L87 Difference]: Start difference. First operand 633 states and 999 transitions. Second operand 4 states. [2019-09-08 04:24:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:07,583 INFO L93 Difference]: Finished difference Result 1221 states and 1949 transitions. [2019-09-08 04:24:07,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:07,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-08 04:24:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:07,592 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 04:24:07,592 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:07,597 INFO L628 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-09-08 04:24:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 976 transitions. [2019-09-08 04:24:07,632 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 976 transitions. Word has length 94 [2019-09-08 04:24:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:07,632 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 976 transitions. [2019-09-08 04:24:07,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 976 transitions. [2019-09-08 04:24:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:24:07,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:07,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:07,636 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1242574475, now seen corresponding path program 1 times [2019-09-08 04:24:07,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:07,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:07,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:07,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:07,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:07,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:07,867 INFO L87 Difference]: Start difference. First operand 620 states and 976 transitions. Second operand 6 states. [2019-09-08 04:24:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:08,097 INFO L93 Difference]: Finished difference Result 1161 states and 1841 transitions. [2019-09-08 04:24:08,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:08,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:24:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:08,104 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:24:08,105 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:08,108 INFO L628 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-09-08 04:24:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 972 transitions. [2019-09-08 04:24:08,135 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 972 transitions. Word has length 95 [2019-09-08 04:24:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:08,137 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 972 transitions. [2019-09-08 04:24:08,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 972 transitions. [2019-09-08 04:24:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:24:08,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:08,140 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:08,141 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 96991961, now seen corresponding path program 1 times [2019-09-08 04:24:08,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:08,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:08,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:08,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:08,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:08,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:08,281 INFO L87 Difference]: Start difference. First operand 620 states and 972 transitions. Second operand 6 states. [2019-09-08 04:24:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:08,479 INFO L93 Difference]: Finished difference Result 1161 states and 1837 transitions. [2019-09-08 04:24:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:08,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:24:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:08,485 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:24:08,485 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:08,488 INFO L628 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-09-08 04:24:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 968 transitions. [2019-09-08 04:24:08,514 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 968 transitions. Word has length 96 [2019-09-08 04:24:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:08,515 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 968 transitions. [2019-09-08 04:24:08,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 968 transitions. [2019-09-08 04:24:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:24:08,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:08,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:08,518 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 44864186, now seen corresponding path program 1 times [2019-09-08 04:24:08,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:08,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:08,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:08,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:08,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:08,645 INFO L87 Difference]: Start difference. First operand 620 states and 968 transitions. Second operand 6 states. [2019-09-08 04:24:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:08,848 INFO L93 Difference]: Finished difference Result 1161 states and 1833 transitions. [2019-09-08 04:24:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:08,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:24:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:08,854 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:24:08,854 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:08,857 INFO L628 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-09-08 04:24:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 964 transitions. [2019-09-08 04:24:08,882 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 964 transitions. Word has length 97 [2019-09-08 04:24:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:08,882 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 964 transitions. [2019-09-08 04:24:08,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 964 transitions. [2019-09-08 04:24:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:24:08,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:08,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:08,886 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2010410810, now seen corresponding path program 1 times [2019-09-08 04:24:08,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:08,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:08,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:08,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:09,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:24:09,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:24:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:24:09,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:24:09,068 INFO L87 Difference]: Start difference. First operand 620 states and 964 transitions. Second operand 7 states. [2019-09-08 04:24:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:09,152 INFO L93 Difference]: Finished difference Result 1161 states and 1829 transitions. [2019-09-08 04:24:09,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:24:09,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 04:24:09,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:09,158 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:24:09,158 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:24:09,161 INFO L628 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-09-08 04:24:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:24:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:24:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:24:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 930 transitions. [2019-09-08 04:24:09,184 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 930 transitions. Word has length 97 [2019-09-08 04:24:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:09,184 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 930 transitions. [2019-09-08 04:24:09,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:24:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 930 transitions. [2019-09-08 04:24:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:24:09,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:09,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:09,187 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash -200111170, now seen corresponding path program 1 times [2019-09-08 04:24:09,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:09,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:09,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:09,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:09,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:09,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:09,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:09,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:09,321 INFO L87 Difference]: Start difference. First operand 599 states and 930 transitions. Second operand 6 states. [2019-09-08 04:24:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:09,443 INFO L93 Difference]: Finished difference Result 1140 states and 1795 transitions. [2019-09-08 04:24:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:09,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 04:24:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:09,448 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 04:24:09,449 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:24:09,453 INFO L628 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-09-08 04:24:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:24:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:24:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:24:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 929 transitions. [2019-09-08 04:24:09,482 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 929 transitions. Word has length 98 [2019-09-08 04:24:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:09,483 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 929 transitions. [2019-09-08 04:24:09,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 929 transitions. [2019-09-08 04:24:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:24:09,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:09,485 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:09,486 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2128394241, now seen corresponding path program 1 times [2019-09-08 04:24:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:09,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:09,633 INFO L87 Difference]: Start difference. First operand 599 states and 929 transitions. Second operand 6 states. [2019-09-08 04:24:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:09,729 INFO L93 Difference]: Finished difference Result 1140 states and 1794 transitions. [2019-09-08 04:24:09,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:09,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-08 04:24:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:09,734 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 04:24:09,735 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:24:09,738 INFO L628 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-09-08 04:24:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:24:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:24:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:24:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 928 transitions. [2019-09-08 04:24:09,759 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 928 transitions. Word has length 99 [2019-09-08 04:24:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:09,759 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 928 transitions. [2019-09-08 04:24:09,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 928 transitions. [2019-09-08 04:24:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:24:09,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:09,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:09,762 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash -404641629, now seen corresponding path program 1 times [2019-09-08 04:24:09,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:09,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:09,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:09,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:09,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:24:09,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:24:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:24:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:24:09,948 INFO L87 Difference]: Start difference. First operand 599 states and 928 transitions. Second operand 12 states. [2019-09-08 04:24:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:10,124 INFO L93 Difference]: Finished difference Result 1141 states and 1793 transitions. [2019-09-08 04:24:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:24:10,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-08 04:24:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:10,130 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 04:24:10,130 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 04:24:10,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:24:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 04:24:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 04:24:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 04:24:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 927 transitions. [2019-09-08 04:24:10,155 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 927 transitions. Word has length 100 [2019-09-08 04:24:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:10,156 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 927 transitions. [2019-09-08 04:24:10,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:24:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 927 transitions. [2019-09-08 04:24:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:24:10,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:10,158 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:10,158 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1635405980, now seen corresponding path program 1 times [2019-09-08 04:24:10,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:10,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:10,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:10,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:10,368 INFO L87 Difference]: Start difference. First operand 599 states and 927 transitions. Second operand 10 states. [2019-09-08 04:24:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:16,587 INFO L93 Difference]: Finished difference Result 1767 states and 2845 transitions. [2019-09-08 04:24:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:24:16,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2019-09-08 04:24:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:16,597 INFO L225 Difference]: With dead ends: 1767 [2019-09-08 04:24:16,598 INFO L226 Difference]: Without dead ends: 1234 [2019-09-08 04:24:16,601 INFO L628 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-09-08 04:24:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-08 04:24:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1204. [2019-09-08 04:24:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-09-08 04:24:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1913 transitions. [2019-09-08 04:24:16,662 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1913 transitions. Word has length 101 [2019-09-08 04:24:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:16,663 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1913 transitions. [2019-09-08 04:24:16,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1913 transitions. [2019-09-08 04:24:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 04:24:16,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:16,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:16,665 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1559201877, now seen corresponding path program 1 times [2019-09-08 04:24:16,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:16,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:16,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:16,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:16,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:16,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:16,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:16,995 INFO L87 Difference]: Start difference. First operand 1204 states and 1913 transitions. Second operand 10 states. [2019-09-08 04:24:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:23,505 INFO L93 Difference]: Finished difference Result 3755 states and 6178 transitions. [2019-09-08 04:24:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:24:23,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2019-09-08 04:24:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:23,538 INFO L225 Difference]: With dead ends: 3755 [2019-09-08 04:24:23,538 INFO L226 Difference]: Without dead ends: 2617 [2019-09-08 04:24:23,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:24:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2019-09-08 04:24:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2576. [2019-09-08 04:24:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-09-08 04:24:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 4181 transitions. [2019-09-08 04:24:23,702 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 4181 transitions. Word has length 102 [2019-09-08 04:24:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:23,703 INFO L475 AbstractCegarLoop]: Abstraction has 2576 states and 4181 transitions. [2019-09-08 04:24:23,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 4181 transitions. [2019-09-08 04:24:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 04:24:23,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:23,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:23,705 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash -962393984, now seen corresponding path program 1 times [2019-09-08 04:24:23,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:23,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:23,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:23,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:23,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:23,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:23,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:23,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:23,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:23,910 INFO L87 Difference]: Start difference. First operand 2576 states and 4181 transitions. Second operand 10 states. [2019-09-08 04:24:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:30,559 INFO L93 Difference]: Finished difference Result 8357 states and 14067 transitions. [2019-09-08 04:24:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:24:30,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 04:24:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:30,611 INFO L225 Difference]: With dead ends: 8357 [2019-09-08 04:24:30,611 INFO L226 Difference]: Without dead ends: 5847 [2019-09-08 04:24:30,633 INFO L628 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-09-08 04:24:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2019-09-08 04:24:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5784. [2019-09-08 04:24:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-09-08 04:24:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 9591 transitions. [2019-09-08 04:24:31,005 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 9591 transitions. Word has length 103 [2019-09-08 04:24:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:31,006 INFO L475 AbstractCegarLoop]: Abstraction has 5784 states and 9591 transitions. [2019-09-08 04:24:31,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 9591 transitions. [2019-09-08 04:24:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 04:24:31,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:31,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:31,008 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1204185167, now seen corresponding path program 1 times [2019-09-08 04:24:31,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:31,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:31,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:31,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:31,173 INFO L87 Difference]: Start difference. First operand 5784 states and 9591 transitions. Second operand 10 states. [2019-09-08 04:24:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:38,239 INFO L93 Difference]: Finished difference Result 19408 states and 33624 transitions. [2019-09-08 04:24:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:24:38,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 04:24:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:38,359 INFO L225 Difference]: With dead ends: 19408 [2019-09-08 04:24:38,359 INFO L226 Difference]: Without dead ends: 13690 [2019-09-08 04:24:38,399 INFO L628 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-09-08 04:24:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13690 states. [2019-09-08 04:24:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13690 to 13583. [2019-09-08 04:24:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13583 states. [2019-09-08 04:24:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13583 states to 13583 states and 23106 transitions. [2019-09-08 04:24:39,183 INFO L78 Accepts]: Start accepts. Automaton has 13583 states and 23106 transitions. Word has length 104 [2019-09-08 04:24:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:39,184 INFO L475 AbstractCegarLoop]: Abstraction has 13583 states and 23106 transitions. [2019-09-08 04:24:39,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13583 states and 23106 transitions. [2019-09-08 04:24:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 04:24:39,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:39,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:39,186 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 494065764, now seen corresponding path program 1 times [2019-09-08 04:24:39,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:39,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:24:39,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:39,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:39,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:39,385 INFO L87 Difference]: Start difference. First operand 13583 states and 23106 transitions. Second operand 10 states. [2019-09-08 04:24:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:46,950 INFO L93 Difference]: Finished difference Result 47197 states and 85045 transitions. [2019-09-08 04:24:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:24:46,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-08 04:24:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:47,201 INFO L225 Difference]: With dead ends: 47197 [2019-09-08 04:24:47,202 INFO L226 Difference]: Without dead ends: 33680 [2019-09-08 04:24:47,288 INFO L628 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-09-08 04:24:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33680 states. [2019-09-08 04:24:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33680 to 33485. [2019-09-08 04:24:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33485 states. [2019-09-08 04:24:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33485 states to 33485 states and 58900 transitions. [2019-09-08 04:24:50,833 INFO L78 Accepts]: Start accepts. Automaton has 33485 states and 58900 transitions. Word has length 105 [2019-09-08 04:24:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:50,834 INFO L475 AbstractCegarLoop]: Abstraction has 33485 states and 58900 transitions. [2019-09-08 04:24:50,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33485 states and 58900 transitions. [2019-09-08 04:24:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 04:24:50,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:50,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:50,836 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 800604403, now seen corresponding path program 1 times [2019-09-08 04:24:50,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:50,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:50,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:50,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-09-08 04:24:50,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:50,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:50,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:50,979 INFO L87 Difference]: Start difference. First operand 33485 states and 58900 transitions. Second operand 10 states. [2019-09-08 04:25:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:02,488 INFO L93 Difference]: Finished difference Result 121082 states and 230403 transitions. [2019-09-08 04:25:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:25:02,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2019-09-08 04:25:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:03,287 INFO L225 Difference]: With dead ends: 121082 [2019-09-08 04:25:03,287 INFO L226 Difference]: Without dead ends: 87663 [2019-09-08 04:25:03,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:25:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87663 states. [2019-09-08 04:25:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87663 to 87292. [2019-09-08 04:25:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87292 states. [2019-09-08 04:25:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87292 states to 87292 states and 160809 transitions. [2019-09-08 04:25:10,034 INFO L78 Accepts]: Start accepts. Automaton has 87292 states and 160809 transitions. Word has length 106 [2019-09-08 04:25:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:10,035 INFO L475 AbstractCegarLoop]: Abstraction has 87292 states and 160809 transitions. [2019-09-08 04:25:10,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:25:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 87292 states and 160809 transitions. [2019-09-08 04:25:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 04:25:10,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:10,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:25:10,037 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1011955316, now seen corresponding path program 1 times [2019-09-08 04:25:10,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:10,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:10,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:25:10,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:25:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:25:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:25:10,133 INFO L87 Difference]: Start difference. First operand 87292 states and 160809 transitions. Second operand 3 states. [2019-09-08 04:25:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:20,600 INFO L93 Difference]: Finished difference Result 261735 states and 529550 transitions. [2019-09-08 04:25:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:25:20,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 04:25:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:22,118 INFO L225 Difference]: With dead ends: 261735 [2019-09-08 04:25:22,119 INFO L226 Difference]: Without dead ends: 174509 [2019-09-08 04:25:22,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:25:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174509 states. [2019-09-08 04:25:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174509 to 174507. [2019-09-08 04:25:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174507 states. [2019-09-08 04:25:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174507 states to 174507 states and 360554 transitions. [2019-09-08 04:25:41,660 INFO L78 Accepts]: Start accepts. Automaton has 174507 states and 360554 transitions. Word has length 106 [2019-09-08 04:25:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:41,661 INFO L475 AbstractCegarLoop]: Abstraction has 174507 states and 360554 transitions. [2019-09-08 04:25:41,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:25:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 174507 states and 360554 transitions. [2019-09-08 04:25:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 04:25:41,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:41,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:25:41,663 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:41,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1304449025, now seen corresponding path program 1 times [2019-09-08 04:25:41,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:25:41,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:41,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:25:41,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:25:41,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:25:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:25:41,784 INFO L87 Difference]: Start difference. First operand 174507 states and 360554 transitions. Second operand 3 states. [2019-09-08 04:26:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:16,784 INFO L93 Difference]: Finished difference Result 523382 states and 1232650 transitions. [2019-09-08 04:26:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:26:16,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 04:26:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:21,790 INFO L225 Difference]: With dead ends: 523382 [2019-09-08 04:26:21,790 INFO L226 Difference]: Without dead ends: 348941 [2019-09-08 04:26:32,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:26:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348941 states. [2019-09-08 04:27:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348941 to 348938. [2019-09-08 04:27:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348938 states. [2019-09-08 04:27:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348938 states to 348938 states and 843364 transitions. [2019-09-08 04:27:26,097 INFO L78 Accepts]: Start accepts. Automaton has 348938 states and 843364 transitions. Word has length 107 [2019-09-08 04:27:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:26,098 INFO L475 AbstractCegarLoop]: Abstraction has 348938 states and 843364 transitions. [2019-09-08 04:27:26,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:27:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 348938 states and 843364 transitions. [2019-09-08 04:27:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 04:27:26,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:26,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:26,100 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1781823318, now seen corresponding path program 1 times [2019-09-08 04:27:26,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:26,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:26,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:27:26,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:27:26,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:27:26,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:27:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:27:26,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:27:26,207 INFO L87 Difference]: Start difference. First operand 348938 states and 843364 transitions. Second operand 3 states.