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_spec2_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:06:34,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:06:34,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:06:34,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:06:34,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:06:34,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:06:34,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:06:34,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:06:34,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:06:34,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:06:34,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:06:34,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:06:34,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:06:34,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:06:34,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:06:34,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:06:34,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:06:34,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:06:34,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:06:34,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:06:34,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:06:34,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:06:34,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:06:34,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:06:34,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:06:34,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:06:34,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:06:34,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:06:34,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:06:34,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:06:34,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:06:34,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:06:34,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:06:34,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:06:34,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:06:34,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:06:34,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:06:34,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:06:34,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:06:34,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:06:34,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:06:34,379 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:06:34,403 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:06:34,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:06:34,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:06:34,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:06:34,405 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:06:34,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:06:34,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:06:34,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:06:34,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:06:34,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:06:34,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:06:34,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:06:34,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:06:34,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:06:34,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:06:34,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:06:34,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:06:34,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:06:34,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:06:34,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:06:34,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:06:34,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:06:34,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:06:34,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:06:34,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:06:34,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:06:34,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:06:34,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:06:34,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:06:34,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:06:34,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:06:34,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:06:34,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:06:34,459 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:06:34,460 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-09-08 04:06:34,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb5bc11/2492081b80d346e1b0915e564584fcf6/FLAG05b0461ab [2019-09-08 04:06:35,194 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:06:35,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product26.cil.c [2019-09-08 04:06:35,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb5bc11/2492081b80d346e1b0915e564584fcf6/FLAG05b0461ab [2019-09-08 04:06:35,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb5bc11/2492081b80d346e1b0915e564584fcf6 [2019-09-08 04:06:35,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:06:35,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:06:35,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:06:35,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:06:35,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:06:35,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:06:35" (1/1) ... [2019-09-08 04:06:35,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1615c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:35, skipping insertion in model container [2019-09-08 04:06:35,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:06:35" (1/1) ... [2019-09-08 04:06:35,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:06:35,472 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:06:36,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:06:36,264 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:06:36,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:06:36,540 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:06:36,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36 WrapperNode [2019-09-08 04:06:36,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:06:36,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:06:36,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:06:36,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:06:36,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (1/1) ... [2019-09-08 04:06:36,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:06:36,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:06:36,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:06:36,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:06:36,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (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:06:36,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:06:36,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:06:36,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:06:36,836 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:06:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:06:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:06:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:06:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:06:36,837 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:06:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:06:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:06:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:06:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:06:36,838 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:06:36,839 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:06:36,839 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:06:36,839 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:06:36,839 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:06:36,839 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:06:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:06:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:06:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:06:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:06:36,840 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:06:36,841 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:06:36,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:06:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__empty [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:06:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:06:36,845 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:06:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:06:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:06:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:06:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:06:36,846 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:06:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:06:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:06:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:06:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:06:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:06:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:06:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:06:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:06:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:06:36,848 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:06:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:06:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:06:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:06:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:06:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:06:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:06:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:06:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:06:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:06:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:06:36,850 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:06:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:06:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:06:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:06:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:06:36,851 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:06:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:06:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:06:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:06:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:06:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:06:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:06:36,854 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:06:36,855 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:06:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:06:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:06:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:06:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:06:36,856 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:06:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:06:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:06:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:06:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:06:36,857 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:06:36,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:06:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:06:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:06:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:06:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:06:36,859 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:06:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:06:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:06:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:06:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:06:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2019-09-08 04:06:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:06:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__empty [2019-09-08 04:06:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:06:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:06:36,861 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:06:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:06:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:06:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:06:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:06:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:06:36,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:06:39,108 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:06:39,108 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:06:39,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:06:39 BoogieIcfgContainer [2019-09-08 04:06:39,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:06:39,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:06:39,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:06:39,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:06:39,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:06:35" (1/3) ... [2019-09-08 04:06:39,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccb8e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:06:39, skipping insertion in model container [2019-09-08 04:06:39,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:06:36" (2/3) ... [2019-09-08 04:06:39,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccb8e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:06:39, skipping insertion in model container [2019-09-08 04:06:39,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:06:39" (3/3) ... [2019-09-08 04:06:39,121 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product26.cil.c [2019-09-08 04:06:39,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:06:39,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:06:39,162 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:06:39,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:06:39,211 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:06:39,211 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:06:39,211 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:06:39,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:06:39,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:06:39,212 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:06:39,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:06:39,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:06:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-08 04:06:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 04:06:39,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:39,280 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] [2019-09-08 04:06:39,286 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:39,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1815299235, now seen corresponding path program 1 times [2019-09-08 04:06:39,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:39,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:39,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:39,845 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:06:39,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:39,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:39,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:39,876 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-08 04:06:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:40,123 INFO L93 Difference]: Finished difference Result 1197 states and 1943 transitions. [2019-09-08 04:06:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:40,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 04:06:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:40,202 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:06:40,202 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:06:40,220 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:06:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:06:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:06:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:06:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 973 transitions. [2019-09-08 04:06:40,337 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 973 transitions. Word has length 85 [2019-09-08 04:06:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:40,338 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 973 transitions. [2019-09-08 04:06:40,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 973 transitions. [2019-09-08 04:06:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 04:06:40,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:40,344 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] [2019-09-08 04:06:40,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1195495049, now seen corresponding path program 1 times [2019-09-08 04:06:40,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:40,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:40,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:40,568 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:06:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:40,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:40,573 INFO L87 Difference]: Start difference. First operand 607 states and 973 transitions. Second operand 4 states. [2019-09-08 04:06:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:40,668 INFO L93 Difference]: Finished difference Result 1177 states and 1904 transitions. [2019-09-08 04:06:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:40,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 04:06:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:40,680 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 04:06:40,681 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:06:40,685 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:06:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:06:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:06:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:06:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-09-08 04:06:40,724 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 88 [2019-09-08 04:06:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:40,725 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-09-08 04:06:40,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-09-08 04:06:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 04:06:40,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:40,729 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] [2019-09-08 04:06:40,730 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash -709071794, now seen corresponding path program 1 times [2019-09-08 04:06:40,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:40,860 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:06:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:40,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:40,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:40,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:40,862 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 4 states. [2019-09-08 04:06:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:40,957 INFO L93 Difference]: Finished difference Result 1177 states and 1903 transitions. [2019-09-08 04:06:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:40,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 04:06:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:40,970 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 04:06:40,970 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:06:40,975 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:06:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:06:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:06:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:06:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 971 transitions. [2019-09-08 04:06:41,030 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 971 transitions. Word has length 89 [2019-09-08 04:06:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:41,031 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 971 transitions. [2019-09-08 04:06:41,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 971 transitions. [2019-09-08 04:06:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:06:41,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:41,035 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:06:41,035 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1566496723, now seen corresponding path program 1 times [2019-09-08 04:06:41,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:41,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:41,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:41,276 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:06:41,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:41,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:41,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:41,280 INFO L87 Difference]: Start difference. First operand 607 states and 971 transitions. Second operand 4 states. [2019-09-08 04:06:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:41,361 INFO L93 Difference]: Finished difference Result 1177 states and 1902 transitions. [2019-09-08 04:06:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:41,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:06:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:41,370 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 04:06:41,370 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:06:41,374 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:06:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:06:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:06:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:06:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 970 transitions. [2019-09-08 04:06:41,406 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 970 transitions. Word has length 90 [2019-09-08 04:06:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:41,407 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 970 transitions. [2019-09-08 04:06:41,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 970 transitions. [2019-09-08 04:06:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:06:41,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:41,411 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:06:41,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -823973782, now seen corresponding path program 1 times [2019-09-08 04:06:41,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:41,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:41,574 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:06:41,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:41,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:41,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:41,575 INFO L87 Difference]: Start difference. First operand 607 states and 970 transitions. Second operand 4 states. [2019-09-08 04:06:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:41,629 INFO L93 Difference]: Finished difference Result 1177 states and 1901 transitions. [2019-09-08 04:06:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:41,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:06:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:41,635 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 04:06:41,636 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:06:41,639 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:06:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:06:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:06:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:06:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 969 transitions. [2019-09-08 04:06:41,664 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 969 transitions. Word has length 91 [2019-09-08 04:06:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:41,665 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 969 transitions. [2019-09-08 04:06:41,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 969 transitions. [2019-09-08 04:06:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:06:41,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:41,668 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:06:41,668 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:41,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1832765905, now seen corresponding path program 1 times [2019-09-08 04:06:41,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:41,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:41,824 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:06:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:06:41,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:06:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:06:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:06:41,826 INFO L87 Difference]: Start difference. First operand 607 states and 969 transitions. Second operand 10 states. [2019-09-08 04:06:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:41,989 INFO L93 Difference]: Finished difference Result 1135 states and 1821 transitions. [2019-09-08 04:06:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:06:41,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 04:06:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:41,996 INFO L225 Difference]: With dead ends: 1135 [2019-09-08 04:06:41,996 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 04:06:41,999 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:06:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 04:06:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 614. [2019-09-08 04:06:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:06:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 978 transitions. [2019-09-08 04:06:42,047 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 978 transitions. Word has length 92 [2019-09-08 04:06:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:42,050 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 978 transitions. [2019-09-08 04:06:42,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:06:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 978 transitions. [2019-09-08 04:06:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:06:42,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:42,054 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:06:42,054 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1812428530, now seen corresponding path program 1 times [2019-09-08 04:06:42,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:42,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:42,183 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:06:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:42,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:42,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:42,185 INFO L87 Difference]: Start difference. First operand 614 states and 978 transitions. Second operand 4 states. [2019-09-08 04:06:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:42,278 INFO L93 Difference]: Finished difference Result 1183 states and 1907 transitions. [2019-09-08 04:06:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:06:42,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:06:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:42,284 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 04:06:42,284 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 04:06:42,287 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:06:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 04:06:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 04:06:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 04:06:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 955 transitions. [2019-09-08 04:06:42,310 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 955 transitions. Word has length 92 [2019-09-08 04:06:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:42,310 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 955 transitions. [2019-09-08 04:06:42,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 955 transitions. [2019-09-08 04:06:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:06:42,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:42,313 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:06:42,313 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1505086713, now seen corresponding path program 1 times [2019-09-08 04:06:42,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:42,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:42,431 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:06:42,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:06:42,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:06:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:06:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:42,434 INFO L87 Difference]: Start difference. First operand 601 states and 955 transitions. Second operand 6 states. [2019-09-08 04:06:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:42,715 INFO L93 Difference]: Finished difference Result 1123 states and 1799 transitions. [2019-09-08 04:06:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:06:42,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 04:06:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:42,721 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 04:06:42,721 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 04:06:42,725 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:06:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 04:06:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 04:06:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 04:06:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 951 transitions. [2019-09-08 04:06:42,765 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 951 transitions. Word has length 93 [2019-09-08 04:06:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:42,768 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 951 transitions. [2019-09-08 04:06:42,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:06:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 951 transitions. [2019-09-08 04:06:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:06:42,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:42,773 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:06:42,773 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:42,774 INFO L82 PathProgramCache]: Analyzing trace with hash 150462354, now seen corresponding path program 1 times [2019-09-08 04:06:42,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:42,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:42,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:42,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:42,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:06:42,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:42,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:06:42,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:06:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:06:42,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:42,948 INFO L87 Difference]: Start difference. First operand 601 states and 951 transitions. Second operand 6 states. [2019-09-08 04:06:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:43,175 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2019-09-08 04:06:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:06:43,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 04:06:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:43,181 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 04:06:43,182 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 04:06:43,185 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:06:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 04:06:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 04:06:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 04:06:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 947 transitions. [2019-09-08 04:06:43,208 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 947 transitions. Word has length 94 [2019-09-08 04:06:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:43,210 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 947 transitions. [2019-09-08 04:06:43,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:06:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 947 transitions. [2019-09-08 04:06:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:06:43,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:43,212 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:06:43,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -105920916, now seen corresponding path program 1 times [2019-09-08 04:06:43,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:43,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:43,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:43,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:43,416 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:06:43,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:43,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:06:43,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:06:43,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:06:43,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:43,418 INFO L87 Difference]: Start difference. First operand 601 states and 947 transitions. Second operand 6 states. [2019-09-08 04:06:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:43,601 INFO L93 Difference]: Finished difference Result 1123 states and 1791 transitions. [2019-09-08 04:06:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:06:43,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:06:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:43,607 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 04:06:43,607 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 04:06:43,610 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:06:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 04:06:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 04:06:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 04:06:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 943 transitions. [2019-09-08 04:06:43,641 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 943 transitions. Word has length 95 [2019-09-08 04:06:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:43,641 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 943 transitions. [2019-09-08 04:06:43,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:06:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 943 transitions. [2019-09-08 04:06:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:06:43,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:43,643 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:06:43,644 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:43,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash 941933292, now seen corresponding path program 1 times [2019-09-08 04:06:43,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:43,781 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:06:43,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:06:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:06:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:06:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:06:43,783 INFO L87 Difference]: Start difference. First operand 601 states and 943 transitions. Second operand 7 states. [2019-09-08 04:06:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:43,863 INFO L93 Difference]: Finished difference Result 1123 states and 1787 transitions. [2019-09-08 04:06:43,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:06:43,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:06:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:43,868 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 04:06:43,868 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 04:06:43,872 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:06:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 04:06:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 04:06:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 04:06:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 909 transitions. [2019-09-08 04:06:43,890 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 909 transitions. Word has length 95 [2019-09-08 04:06:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:43,891 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 909 transitions. [2019-09-08 04:06:43,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:06:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 909 transitions. [2019-09-08 04:06:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:06:43,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:43,893 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:06:43,893 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 497335511, now seen corresponding path program 1 times [2019-09-08 04:06:43,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:44,000 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:06:44,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:44,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:06:44,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:06:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:06:44,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:44,001 INFO L87 Difference]: Start difference. First operand 580 states and 909 transitions. Second operand 6 states. [2019-09-08 04:06:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:44,099 INFO L93 Difference]: Finished difference Result 1102 states and 1753 transitions. [2019-09-08 04:06:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:06:44,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:06:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:44,104 INFO L225 Difference]: With dead ends: 1102 [2019-09-08 04:06:44,105 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 04:06:44,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:06:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 04:06:44,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 04:06:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 04:06:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 908 transitions. [2019-09-08 04:06:44,130 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 908 transitions. Word has length 96 [2019-09-08 04:06:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:44,130 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 908 transitions. [2019-09-08 04:06:44,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:06:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 908 transitions. [2019-09-08 04:06:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:06:44,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:44,133 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:06:44,133 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1979618769, now seen corresponding path program 1 times [2019-09-08 04:06:44,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:44,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:44,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:44,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:44,249 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:06:44,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:44,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:06:44,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:06:44,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:06:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:44,251 INFO L87 Difference]: Start difference. First operand 580 states and 908 transitions. Second operand 6 states. [2019-09-08 04:06:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:44,393 INFO L93 Difference]: Finished difference Result 1102 states and 1752 transitions. [2019-09-08 04:06:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:06:44,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:06:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:44,398 INFO L225 Difference]: With dead ends: 1102 [2019-09-08 04:06:44,398 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 04:06:44,401 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:06:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 04:06:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 04:06:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 04:06:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 907 transitions. [2019-09-08 04:06:44,421 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 907 transitions. Word has length 97 [2019-09-08 04:06:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:44,421 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 907 transitions. [2019-09-08 04:06:44,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:06:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 907 transitions. [2019-09-08 04:06:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:06:44,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:44,424 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:06:44,424 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 646962716, now seen corresponding path program 1 times [2019-09-08 04:06:44,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:44,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:44,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:44,607 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:06:44,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:06:44,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:06:44,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:06:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:06:44,609 INFO L87 Difference]: Start difference. First operand 580 states and 907 transitions. Second operand 12 states. [2019-09-08 04:06:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:44,777 INFO L93 Difference]: Finished difference Result 1103 states and 1751 transitions. [2019-09-08 04:06:44,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:06:44,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 04:06:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:44,782 INFO L225 Difference]: With dead ends: 1103 [2019-09-08 04:06:44,782 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 04:06:44,785 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:06:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 04:06:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-09-08 04:06:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-09-08 04:06:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 906 transitions. [2019-09-08 04:06:44,804 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 906 transitions. Word has length 98 [2019-09-08 04:06:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:44,805 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 906 transitions. [2019-09-08 04:06:44,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:06:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 906 transitions. [2019-09-08 04:06:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:06:44,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:44,807 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:06:44,808 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:44,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1922891352, now seen corresponding path program 1 times [2019-09-08 04:06:44,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:44,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:44,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:44,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:06:44,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:44,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:06:44,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:06:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:06:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:06:44,948 INFO L87 Difference]: Start difference. First operand 580 states and 906 transitions. Second operand 9 states. [2019-09-08 04:06:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:51,582 INFO L93 Difference]: Finished difference Result 1574 states and 2521 transitions. [2019-09-08 04:06:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 04:06:51,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 04:06:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:51,599 INFO L225 Difference]: With dead ends: 1574 [2019-09-08 04:06:51,600 INFO L226 Difference]: Without dead ends: 1060 [2019-09-08 04:06:51,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:06:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-09-08 04:06:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1028. [2019-09-08 04:06:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-09-08 04:06:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1603 transitions. [2019-09-08 04:06:51,682 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1603 transitions. Word has length 99 [2019-09-08 04:06:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:51,683 INFO L475 AbstractCegarLoop]: Abstraction has 1028 states and 1603 transitions. [2019-09-08 04:06:51,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:06:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1603 transitions. [2019-09-08 04:06:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:06:51,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:51,691 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:06:51,691 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1808185200, now seen corresponding path program 1 times [2019-09-08 04:06:51,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:51,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:51,911 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:06:51,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:51,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:06:51,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:06:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:06:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:06:51,917 INFO L87 Difference]: Start difference. First operand 1028 states and 1603 transitions. Second operand 5 states. [2019-09-08 04:06:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:54,061 INFO L93 Difference]: Finished difference Result 3086 states and 4948 transitions. [2019-09-08 04:06:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:06:54,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 04:06:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:54,078 INFO L225 Difference]: With dead ends: 3086 [2019-09-08 04:06:54,078 INFO L226 Difference]: Without dead ends: 2125 [2019-09-08 04:06:54,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:06:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-09-08 04:06:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2097. [2019-09-08 04:06:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-09-08 04:06:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3364 transitions. [2019-09-08 04:06:54,187 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3364 transitions. Word has length 100 [2019-09-08 04:06:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:54,187 INFO L475 AbstractCegarLoop]: Abstraction has 2097 states and 3364 transitions. [2019-09-08 04:06:54,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:06:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3364 transitions. [2019-09-08 04:06:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:06:54,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:54,190 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:06:54,190 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -220478198, now seen corresponding path program 1 times [2019-09-08 04:06:54,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:54,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:54,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:54,316 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:06:54,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:54,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:54,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:54,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:54,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:54,318 INFO L87 Difference]: Start difference. First operand 2097 states and 3364 transitions. Second operand 4 states. [2019-09-08 04:06:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:56,578 INFO L93 Difference]: Finished difference Result 6525 states and 10791 transitions. [2019-09-08 04:06:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:06:56,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-08 04:06:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:56,616 INFO L225 Difference]: With dead ends: 6525 [2019-09-08 04:06:56,617 INFO L226 Difference]: Without dead ends: 4496 [2019-09-08 04:06:56,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:06:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2019-09-08 04:06:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4439. [2019-09-08 04:06:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4439 states. [2019-09-08 04:06:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7371 transitions. [2019-09-08 04:06:56,870 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7371 transitions. Word has length 101 [2019-09-08 04:06:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:56,872 INFO L475 AbstractCegarLoop]: Abstraction has 4439 states and 7371 transitions. [2019-09-08 04:06:56,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7371 transitions. [2019-09-08 04:06:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 04:06:56,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:56,874 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:06:56,875 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1753802514, now seen corresponding path program 1 times [2019-09-08 04:06:56,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:56,982 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:06:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:56,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:56,984 INFO L87 Difference]: Start difference. First operand 4439 states and 7371 transitions. Second operand 4 states. [2019-09-08 04:06:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:06:59,081 INFO L93 Difference]: Finished difference Result 14169 states and 24563 transitions. [2019-09-08 04:06:59,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:06:59,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-08 04:06:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:06:59,172 INFO L225 Difference]: With dead ends: 14169 [2019-09-08 04:06:59,172 INFO L226 Difference]: Without dead ends: 9800 [2019-09-08 04:06:59,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:06:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9800 states. [2019-09-08 04:06:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9800 to 9682. [2019-09-08 04:06:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-09-08 04:06:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 16883 transitions. [2019-09-08 04:06:59,906 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 16883 transitions. Word has length 102 [2019-09-08 04:06:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:59,907 INFO L475 AbstractCegarLoop]: Abstraction has 9682 states and 16883 transitions. [2019-09-08 04:06:59,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 16883 transitions. [2019-09-08 04:06:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 04:06:59,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:59,909 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:06:59,909 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1468000948, now seen corresponding path program 1 times [2019-09-08 04:06:59,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:59,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:00,019 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:07:00,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:00,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:00,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:00,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:00,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:00,021 INFO L87 Difference]: Start difference. First operand 9682 states and 16883 transitions. Second operand 4 states. [2019-09-08 04:07:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:03,200 INFO L93 Difference]: Finished difference Result 31568 states and 58826 transitions. [2019-09-08 04:07:03,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:07:03,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-08 04:07:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:03,427 INFO L225 Difference]: With dead ends: 31568 [2019-09-08 04:07:03,428 INFO L226 Difference]: Without dead ends: 21960 [2019-09-08 04:07:03,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:07:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21960 states. [2019-09-08 04:07:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21960 to 21709. [2019-09-08 04:07:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21709 states. [2019-09-08 04:07:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21709 states to 21709 states and 40667 transitions. [2019-09-08 04:07:05,051 INFO L78 Accepts]: Start accepts. Automaton has 21709 states and 40667 transitions. Word has length 103 [2019-09-08 04:07:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:05,052 INFO L475 AbstractCegarLoop]: Abstraction has 21709 states and 40667 transitions. [2019-09-08 04:07:05,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21709 states and 40667 transitions. [2019-09-08 04:07:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 04:07:05,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:05,055 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:07:05,055 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1735310740, now seen corresponding path program 1 times [2019-09-08 04:07:05,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:05,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:05,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:05,375 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:07:05,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:05,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:07:05,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:07:05,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:07:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:07:05,377 INFO L87 Difference]: Start difference. First operand 21709 states and 40667 transitions. Second operand 4 states. [2019-09-08 04:07:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:08,890 INFO L93 Difference]: Finished difference Result 72199 states and 150016 transitions. [2019-09-08 04:07:08,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:07:08,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-08 04:07:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:11,066 INFO L225 Difference]: With dead ends: 72199 [2019-09-08 04:07:11,067 INFO L226 Difference]: Without dead ends: 50560 [2019-09-08 04:07:11,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:07:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50560 states. [2019-09-08 04:07:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50560 to 50010. [2019-09-08 04:07:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50010 states. [2019-09-08 04:07:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50010 states to 50010 states and 103931 transitions. [2019-09-08 04:07:16,848 INFO L78 Accepts]: Start accepts. Automaton has 50010 states and 103931 transitions. Word has length 104 [2019-09-08 04:07:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:16,849 INFO L475 AbstractCegarLoop]: Abstraction has 50010 states and 103931 transitions. [2019-09-08 04:07:16,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:07:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50010 states and 103931 transitions. [2019-09-08 04:07:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 04:07:16,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:16,877 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:16,878 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -655687788, now seen corresponding path program 1 times [2019-09-08 04:07:16,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 04:07:17,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:07:17,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:07:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:17,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 4110 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 04:07:17,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:07:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 04:07:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:07:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-08 04:07:18,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:07:18,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:07:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:07:18,140 INFO L87 Difference]: Start difference. First operand 50010 states and 103931 transitions. Second operand 12 states. [2019-09-08 04:07:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:28,481 INFO L93 Difference]: Finished difference Result 109490 states and 227605 transitions. [2019-09-08 04:07:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:07:28,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 282 [2019-09-08 04:07:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:29,595 INFO L225 Difference]: With dead ends: 109490 [2019-09-08 04:07:29,595 INFO L226 Difference]: Without dead ends: 59511 [2019-09-08 04:07:29,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-09-08 04:07:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59511 states. [2019-09-08 04:07:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59511 to 53928. [2019-09-08 04:07:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53928 states. [2019-09-08 04:07:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53928 states to 53928 states and 110772 transitions. [2019-09-08 04:07:35,271 INFO L78 Accepts]: Start accepts. Automaton has 53928 states and 110772 transitions. Word has length 282 [2019-09-08 04:07:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:35,271 INFO L475 AbstractCegarLoop]: Abstraction has 53928 states and 110772 transitions. [2019-09-08 04:07:35,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:07:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 53928 states and 110772 transitions. [2019-09-08 04:07:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:07:35,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:35,318 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:35,319 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash -851689544, now seen corresponding path program 1 times [2019-09-08 04:07:35,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:35,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 04:07:35,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:35,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:07:35,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:07:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:07:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:07:35,545 INFO L87 Difference]: Start difference. First operand 53928 states and 110772 transitions. Second operand 12 states. [2019-09-08 04:07:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:07:50,337 INFO L93 Difference]: Finished difference Result 150537 states and 324719 transitions. [2019-09-08 04:07:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:07:50,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 228 [2019-09-08 04:07:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:07:51,167 INFO L225 Difference]: With dead ends: 150537 [2019-09-08 04:07:51,168 INFO L226 Difference]: Without dead ends: 96675 [2019-09-08 04:07:51,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:07:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96675 states. [2019-09-08 04:07:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96675 to 95285. [2019-09-08 04:07:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95285 states. [2019-09-08 04:07:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95285 states to 95285 states and 199703 transitions. [2019-09-08 04:07:57,385 INFO L78 Accepts]: Start accepts. Automaton has 95285 states and 199703 transitions. Word has length 228 [2019-09-08 04:07:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:07:57,385 INFO L475 AbstractCegarLoop]: Abstraction has 95285 states and 199703 transitions. [2019-09-08 04:07:57,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:07:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 95285 states and 199703 transitions. [2019-09-08 04:07:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 04:07:57,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:07:57,422 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:07:57,422 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:07:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:07:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -505631221, now seen corresponding path program 1 times [2019-09-08 04:07:57,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:07:57,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:07:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:57,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:07:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:07:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:07:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 04:07:57,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:07:57,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:07:57,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:07:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:07:57,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:07:57,605 INFO L87 Difference]: Start difference. First operand 95285 states and 199703 transitions. Second operand 9 states. [2019-09-08 04:08:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:08,907 INFO L93 Difference]: Finished difference Result 191824 states and 428603 transitions. [2019-09-08 04:08:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:08:08,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2019-09-08 04:08:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:09,660 INFO L225 Difference]: With dead ends: 191824 [2019-09-08 04:08:09,660 INFO L226 Difference]: Without dead ends: 96605 [2019-09-08 04:08:10,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:08:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96605 states. [2019-09-08 04:08:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96605 to 96077. [2019-09-08 04:08:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96077 states. [2019-09-08 04:08:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96077 states to 96077 states and 202079 transitions. [2019-09-08 04:08:20,137 INFO L78 Accepts]: Start accepts. Automaton has 96077 states and 202079 transitions. Word has length 229 [2019-09-08 04:08:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:08:20,138 INFO L475 AbstractCegarLoop]: Abstraction has 96077 states and 202079 transitions. [2019-09-08 04:08:20,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:08:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 96077 states and 202079 transitions. [2019-09-08 04:08:20,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:08:20,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:08:20,168 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:08:20,168 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:08:20,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:08:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 443189989, now seen corresponding path program 1 times [2019-09-08 04:08:20,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:08:20,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:08:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:20,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:08:20,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:08:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:08:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 04:08:20,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:08:20,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:08:20,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:08:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:08:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:08:20,331 INFO L87 Difference]: Start difference. First operand 96077 states and 202079 transitions. Second operand 8 states. [2019-09-08 04:08:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:08:38,229 INFO L93 Difference]: Finished difference Result 310899 states and 700482 transitions. [2019-09-08 04:08:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:08:38,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-08 04:08:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:08:39,676 INFO L225 Difference]: With dead ends: 310899 [2019-09-08 04:08:39,677 INFO L226 Difference]: Without dead ends: 214690 [2019-09-08 04:08:40,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:08:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214690 states. [2019-09-08 04:09:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214690 to 212320. [2019-09-08 04:09:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212320 states. [2019-09-08 04:09:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212320 states to 212320 states and 462370 transitions. [2019-09-08 04:09:02,776 INFO L78 Accepts]: Start accepts. Automaton has 212320 states and 462370 transitions. Word has length 230 [2019-09-08 04:09:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:09:02,777 INFO L475 AbstractCegarLoop]: Abstraction has 212320 states and 462370 transitions. [2019-09-08 04:09:02,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:09:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 212320 states and 462370 transitions. [2019-09-08 04:09:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 04:09:04,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:09:04,074 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:09:04,074 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:09:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:09:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1236122835, now seen corresponding path program 1 times [2019-09-08 04:09:04,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:09:04,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:09:04,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:09:04,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:09:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:09:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 04:09:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:09:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:09:04,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:09:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:09:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:09:04,284 INFO L87 Difference]: Start difference. First operand 212320 states and 462370 transitions. Second operand 9 states. [2019-09-08 04:10:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:10:13,875 INFO L93 Difference]: Finished difference Result 804893 states and 2425074 transitions. [2019-09-08 04:10:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:10:13,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2019-09-08 04:10:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:10:41,501 INFO L225 Difference]: With dead ends: 804893 [2019-09-08 04:10:41,502 INFO L226 Difference]: Without dead ends: 592447 [2019-09-08 04:10:43,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:10:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592447 states. [2019-09-08 04:11:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592447 to 510169. [2019-09-08 04:11:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510169 states.