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_spec3_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:12:17,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:12:17,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:12:17,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:12:17,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:12:17,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:12:17,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:12:17,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:12:17,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:12:17,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:12:17,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:12:17,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:12:17,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:12:17,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:12:17,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:12:17,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:12:17,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:12:17,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:12:17,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:12:17,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:12:17,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:12:17,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:12:17,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:12:17,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:12:17,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:12:17,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:12:17,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:12:17,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:12:17,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:12:17,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:12:17,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:12:17,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:12:17,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:12:17,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:12:17,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:12:17,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:12:17,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:12:17,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:12:17,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:12:17,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:12:17,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:12:17,376 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:12:17,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:12:17,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:12:17,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:12:17,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:12:17,395 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:12:17,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:12:17,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:12:17,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:12:17,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:12:17,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:12:17,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:12:17,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:12:17,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:12:17,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:12:17,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:12:17,397 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:12:17,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:12:17,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:12:17,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:12:17,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:12:17,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:12:17,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:12:17,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:12:17,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:12:17,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:12:17,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:12:17,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:12:17,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:12:17,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:12:17,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:12:17,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:12:17,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:12:17,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:12:17,449 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:12:17,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2019-09-08 04:12:17,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba9cb14/06ca4168b5814695928f9550c31fb187/FLAG43ae5c3ac [2019-09-08 04:12:18,162 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:12:18,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2019-09-08 04:12:18,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba9cb14/06ca4168b5814695928f9550c31fb187/FLAG43ae5c3ac [2019-09-08 04:12:18,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddba9cb14/06ca4168b5814695928f9550c31fb187 [2019-09-08 04:12:18,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:12:18,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:12:18,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:12:18,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:12:18,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:12:18,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:18" (1/1) ... [2019-09-08 04:12:18,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324045ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:18, skipping insertion in model container [2019-09-08 04:12:18,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:12:18" (1/1) ... [2019-09-08 04:12:18,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:12:18,464 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:12:19,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:12:19,234 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:12:19,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:12:19,484 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:12:19,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19 WrapperNode [2019-09-08 04:12:19,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:12:19,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:12:19,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:12:19,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:12:19,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (1/1) ... [2019-09-08 04:12:19,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:12:19,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:12:19,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:12:19,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:12:19,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (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:12:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:12:19,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:12:19,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:12:19,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:12:19,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:12:19,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:12:19,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:12:19,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:12:19,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:12:19,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:12:19,800 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:12:19,800 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:12:19,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:12:19,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:12:19,802 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:12:19,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:12:19,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:12:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:12:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:12:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:12:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:12:19,805 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:12:19,806 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:12:19,807 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:12:19,808 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:12:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:12:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:12:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:12:19,809 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:12:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:12:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:12:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:12:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:12:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:12:19,812 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:12:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:12:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:12:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:12:19,813 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:12:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:12:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:12:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:12:19,814 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:12:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:12:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:12:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:12:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:12:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:12:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:12:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:12:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:12:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:12:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:12:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:12:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:12:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:12:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:12:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:12:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:12:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:12:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:12:19,820 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:12:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:12:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:12:19,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:12:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:12:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:12:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:12:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:12:19,822 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:12:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:12:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:12:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:12:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:12:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:12:19,824 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:12:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:12:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:12:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:12:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:12:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:12:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:12:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:12:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:12:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:12:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:12:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:12:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:12:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:12:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:12:19,828 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:12:19,829 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:12:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:12:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:12:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:12:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:12:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:12:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:12:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:12:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:12:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:12:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:12:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:12:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:12:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:12:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:12:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:12:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:12:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:12:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:12:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:12:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:12:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:12:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:12:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:12:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:12:22,098 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:12:22,099 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:12:22,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:22 BoogieIcfgContainer [2019-09-08 04:12:22,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:12:22,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:12:22,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:12:22,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:12:22,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:12:18" (1/3) ... [2019-09-08 04:12:22,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d78bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:22, skipping insertion in model container [2019-09-08 04:12:22,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:12:19" (2/3) ... [2019-09-08 04:12:22,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d78bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:12:22, skipping insertion in model container [2019-09-08 04:12:22,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:12:22" (3/3) ... [2019-09-08 04:12:22,110 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product11.cil.c [2019-09-08 04:12:22,120 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:12:22,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:12:22,148 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:12:22,200 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:12:22,200 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:12:22,201 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:12:22,201 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:12:22,201 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:12:22,201 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:12:22,201 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:12:22,201 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:12:22,201 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:12:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states. [2019-09-08 04:12:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:12:22,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:22,274 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:22,277 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1989495119, now seen corresponding path program 1 times [2019-09-08 04:12:22,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:23,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:23,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:23,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:23,070 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 7 states. [2019-09-08 04:12:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:23,424 INFO L93 Difference]: Finished difference Result 1249 states and 2024 transitions. [2019-09-08 04:12:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:23,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-08 04:12:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:23,465 INFO L225 Difference]: With dead ends: 1249 [2019-09-08 04:12:23,465 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 04:12:23,481 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:12:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 04:12:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2019-09-08 04:12:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-09-08 04:12:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1007 transitions. [2019-09-08 04:12:23,625 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1007 transitions. Word has length 141 [2019-09-08 04:12:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:23,625 INFO L475 AbstractCegarLoop]: Abstraction has 631 states and 1007 transitions. [2019-09-08 04:12:23,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1007 transitions. [2019-09-08 04:12:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:12:23,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:23,638 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:23,638 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1567093572, now seen corresponding path program 1 times [2019-09-08 04:12:23,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:23,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:23,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:23,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:23,877 INFO L87 Difference]: Start difference. First operand 631 states and 1007 transitions. Second operand 4 states. [2019-09-08 04:12:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:23,950 INFO L93 Difference]: Finished difference Result 1228 states and 1979 transitions. [2019-09-08 04:12:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:12:23,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-08 04:12:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:23,956 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 04:12:23,956 INFO L226 Difference]: Without dead ends: 613 [2019-09-08 04:12:23,960 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:12:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-08 04:12:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-09-08 04:12:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-09-08 04:12:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 974 transitions. [2019-09-08 04:12:23,989 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 974 transitions. Word has length 142 [2019-09-08 04:12:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:23,989 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 974 transitions. [2019-09-08 04:12:23,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 974 transitions. [2019-09-08 04:12:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:12:23,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:23,994 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:23,995 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash 972664476, now seen corresponding path program 1 times [2019-09-08 04:12:23,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:23,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:23,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:24,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:24,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:24,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:24,247 INFO L87 Difference]: Start difference. First operand 613 states and 974 transitions. Second operand 7 states. [2019-09-08 04:12:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:24,369 INFO L93 Difference]: Finished difference Result 1197 states and 1921 transitions. [2019-09-08 04:12:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:24,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 04:12:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:24,375 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:12:24,375 INFO L226 Difference]: Without dead ends: 607 [2019-09-08 04:12:24,378 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:12:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-09-08 04:12:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-09-08 04:12:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 04:12:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 961 transitions. [2019-09-08 04:12:24,404 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 961 transitions. Word has length 142 [2019-09-08 04:12:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:24,405 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 961 transitions. [2019-09-08 04:12:24,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 961 transitions. [2019-09-08 04:12:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:12:24,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:24,410 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:24,410 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:24,411 INFO L82 PathProgramCache]: Analyzing trace with hash 894552595, now seen corresponding path program 1 times [2019-09-08 04:12:24,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:24,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:24,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:24,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:24,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:24,596 INFO L87 Difference]: Start difference. First operand 607 states and 961 transitions. Second operand 7 states. [2019-09-08 04:12:24,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:24,699 INFO L93 Difference]: Finished difference Result 1185 states and 1895 transitions. [2019-09-08 04:12:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:24,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 04:12:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:24,711 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 04:12:24,712 INFO L226 Difference]: Without dead ends: 601 [2019-09-08 04:12:24,716 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:12:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-08 04:12:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-09-08 04:12:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-09-08 04:12:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 948 transitions. [2019-09-08 04:12:24,744 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 948 transitions. Word has length 143 [2019-09-08 04:12:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 601 states and 948 transitions. [2019-09-08 04:12:24,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 948 transitions. [2019-09-08 04:12:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:12:24,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:24,750 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:24,750 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -148048736, now seen corresponding path program 1 times [2019-09-08 04:12:24,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:24,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:24,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:24,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:24,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:24,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:25,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:25,001 INFO L87 Difference]: Start difference. First operand 601 states and 948 transitions. Second operand 7 states. [2019-09-08 04:12:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:25,124 INFO L93 Difference]: Finished difference Result 1173 states and 1869 transitions. [2019-09-08 04:12:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:25,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-09-08 04:12:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:25,140 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 04:12:25,140 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:25,150 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:12:25,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 935 transitions. [2019-09-08 04:12:25,183 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 935 transitions. Word has length 144 [2019-09-08 04:12:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:25,184 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 935 transitions. [2019-09-08 04:12:25,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 935 transitions. [2019-09-08 04:12:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:12:25,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:25,191 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:25,192 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1386995551, now seen corresponding path program 1 times [2019-09-08 04:12:25,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:25,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:25,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:25,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:25,403 INFO L87 Difference]: Start difference. First operand 595 states and 935 transitions. Second operand 7 states. [2019-09-08 04:12:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:25,488 INFO L93 Difference]: Finished difference Result 1161 states and 1843 transitions. [2019-09-08 04:12:25,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:12:25,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-09-08 04:12:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:25,498 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:12:25,498 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:25,502 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:12:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 934 transitions. [2019-09-08 04:12:25,536 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 934 transitions. Word has length 144 [2019-09-08 04:12:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:25,538 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 934 transitions. [2019-09-08 04:12:25,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 934 transitions. [2019-09-08 04:12:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:12:25,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:25,543 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:25,543 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1025051945, now seen corresponding path program 1 times [2019-09-08 04:12:25,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:25,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:25,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:25,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:25,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:25,761 INFO L87 Difference]: Start difference. First operand 595 states and 934 transitions. Second operand 5 states. [2019-09-08 04:12:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:25,844 INFO L93 Difference]: Finished difference Result 1160 states and 1840 transitions. [2019-09-08 04:12:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:25,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 04:12:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:25,850 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 04:12:25,850 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:25,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 933 transitions. [2019-09-08 04:12:25,876 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 933 transitions. Word has length 145 [2019-09-08 04:12:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:25,876 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 933 transitions. [2019-09-08 04:12:25,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 933 transitions. [2019-09-08 04:12:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:12:25,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:25,881 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:25,881 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:25,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 977022328, now seen corresponding path program 1 times [2019-09-08 04:12:25,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:26,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:26,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:26,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:26,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:26,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:26,056 INFO L87 Difference]: Start difference. First operand 595 states and 933 transitions. Second operand 5 states. [2019-09-08 04:12:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:26,132 INFO L93 Difference]: Finished difference Result 1160 states and 1838 transitions. [2019-09-08 04:12:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:26,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 04:12:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:26,137 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 04:12:26,138 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:26,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 932 transitions. [2019-09-08 04:12:26,162 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 932 transitions. Word has length 146 [2019-09-08 04:12:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:26,162 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 932 transitions. [2019-09-08 04:12:26,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 932 transitions. [2019-09-08 04:12:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:12:26,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:26,166 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:26,167 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 269954642, now seen corresponding path program 1 times [2019-09-08 04:12:26,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:26,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:26,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:26,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:26,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:26,311 INFO L87 Difference]: Start difference. First operand 595 states and 932 transitions. Second operand 5 states. [2019-09-08 04:12:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:26,381 INFO L93 Difference]: Finished difference Result 1160 states and 1836 transitions. [2019-09-08 04:12:26,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:26,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-08 04:12:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:26,385 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 04:12:26,386 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:26,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 931 transitions. [2019-09-08 04:12:26,421 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 931 transitions. Word has length 147 [2019-09-08 04:12:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:26,425 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 931 transitions. [2019-09-08 04:12:26,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 931 transitions. [2019-09-08 04:12:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 04:12:26,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:26,431 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:26,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1478832147, now seen corresponding path program 1 times [2019-09-08 04:12:26,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:26,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:26,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:26,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:12:26,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:12:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:12:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:12:26,628 INFO L87 Difference]: Start difference. First operand 595 states and 931 transitions. Second operand 5 states. [2019-09-08 04:12:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:26,704 INFO L93 Difference]: Finished difference Result 1160 states and 1834 transitions. [2019-09-08 04:12:26,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:26,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-08 04:12:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:26,709 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 04:12:26,709 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 04:12:26,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:12:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 04:12:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-09-08 04:12:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-09-08 04:12:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 930 transitions. [2019-09-08 04:12:26,739 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 930 transitions. Word has length 148 [2019-09-08 04:12:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:26,740 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 930 transitions. [2019-09-08 04:12:26,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:12:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 930 transitions. [2019-09-08 04:12:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:12:26,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:26,745 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:26,745 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1952468429, now seen corresponding path program 1 times [2019-09-08 04:12:26,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:26,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:12:26,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:12:26,958 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) [2019-09-08 04:12:26,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:12:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:12:27,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:12:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 04:12:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:12:27,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 04:12:27,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:12:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:12:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:12:27,623 INFO L87 Difference]: Start difference. First operand 595 states and 930 transitions. Second operand 9 states. [2019-09-08 04:12:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:33,307 INFO L93 Difference]: Finished difference Result 3616 states and 5822 transitions. [2019-09-08 04:12:33,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 04:12:33,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-09-08 04:12:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:33,330 INFO L225 Difference]: With dead ends: 3616 [2019-09-08 04:12:33,330 INFO L226 Difference]: Without dead ends: 3055 [2019-09-08 04:12:33,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:12:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-09-08 04:12:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2929. [2019-09-08 04:12:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2019-09-08 04:12:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4638 transitions. [2019-09-08 04:12:33,486 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4638 transitions. Word has length 149 [2019-09-08 04:12:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:33,491 INFO L475 AbstractCegarLoop]: Abstraction has 2929 states and 4638 transitions. [2019-09-08 04:12:33,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:12:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4638 transitions. [2019-09-08 04:12:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 04:12:33,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:33,497 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:33,498 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash -417982129, now seen corresponding path program 1 times [2019-09-08 04:12:33,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:33,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:33,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:33,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:33,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:33,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:33,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:33,712 INFO L87 Difference]: Start difference. First operand 2929 states and 4638 transitions. Second operand 7 states. [2019-09-08 04:12:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:36,359 INFO L93 Difference]: Finished difference Result 8691 states and 14085 transitions. [2019-09-08 04:12:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:36,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-08 04:12:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:36,408 INFO L225 Difference]: With dead ends: 8691 [2019-09-08 04:12:36,408 INFO L226 Difference]: Without dead ends: 5796 [2019-09-08 04:12:36,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2019-09-08 04:12:36,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 5712. [2019-09-08 04:12:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2019-09-08 04:12:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 9183 transitions. [2019-09-08 04:12:36,714 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 9183 transitions. Word has length 153 [2019-09-08 04:12:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:36,714 INFO L475 AbstractCegarLoop]: Abstraction has 5712 states and 9183 transitions. [2019-09-08 04:12:36,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 9183 transitions. [2019-09-08 04:12:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:12:36,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:36,720 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:36,720 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1493300251, now seen corresponding path program 1 times [2019-09-08 04:12:36,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:12:36,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:36,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:36,847 INFO L87 Difference]: Start difference. First operand 5712 states and 9183 transitions. Second operand 4 states. [2019-09-08 04:12:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:37,250 INFO L93 Difference]: Finished difference Result 11378 states and 18459 transitions. [2019-09-08 04:12:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:37,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-08 04:12:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:37,297 INFO L225 Difference]: With dead ends: 11378 [2019-09-08 04:12:37,298 INFO L226 Difference]: Without dead ends: 5700 [2019-09-08 04:12:37,337 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:12:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2019-09-08 04:12:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5682. [2019-09-08 04:12:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5682 states. [2019-09-08 04:12:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 5682 states and 9095 transitions. [2019-09-08 04:12:37,585 INFO L78 Accepts]: Start accepts. Automaton has 5682 states and 9095 transitions. Word has length 154 [2019-09-08 04:12:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:37,586 INFO L475 AbstractCegarLoop]: Abstraction has 5682 states and 9095 transitions. [2019-09-08 04:12:37,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5682 states and 9095 transitions. [2019-09-08 04:12:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:12:37,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:37,591 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:37,592 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1925083281, now seen corresponding path program 1 times [2019-09-08 04:12:37,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:37,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:12:37,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:12:37,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:12:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:38,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:12:38,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:12:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:12:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:12:38,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:12:38,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:12:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:12:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:12:38,419 INFO L87 Difference]: Start difference. First operand 5682 states and 9095 transitions. Second operand 12 states. [2019-09-08 04:12:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:44,178 INFO L93 Difference]: Finished difference Result 18269 states and 30026 transitions. [2019-09-08 04:12:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 04:12:44,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2019-09-08 04:12:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:44,280 INFO L225 Difference]: With dead ends: 18269 [2019-09-08 04:12:44,280 INFO L226 Difference]: Without dead ends: 12603 [2019-09-08 04:12:44,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:12:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12603 states. [2019-09-08 04:12:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12603 to 8427. [2019-09-08 04:12:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-09-08 04:12:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 13445 transitions. [2019-09-08 04:12:44,785 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 13445 transitions. Word has length 150 [2019-09-08 04:12:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:44,786 INFO L475 AbstractCegarLoop]: Abstraction has 8427 states and 13445 transitions. [2019-09-08 04:12:44,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:12:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 13445 transitions. [2019-09-08 04:12:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:12:44,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:44,791 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:12:44,792 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1440760950, now seen corresponding path program 1 times [2019-09-08 04:12:44,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:44,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 04:12:44,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:44,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:44,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:44,998 INFO L87 Difference]: Start difference. First operand 8427 states and 13445 transitions. Second operand 7 states. [2019-09-08 04:12:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:48,128 INFO L93 Difference]: Finished difference Result 25189 states and 41158 transitions. [2019-09-08 04:12:48,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:48,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-09-08 04:12:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:48,274 INFO L225 Difference]: With dead ends: 25189 [2019-09-08 04:12:48,274 INFO L226 Difference]: Without dead ends: 16796 [2019-09-08 04:12:48,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16796 states. [2019-09-08 04:12:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16796 to 16664. [2019-09-08 04:12:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16664 states. [2019-09-08 04:12:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16664 states to 16664 states and 26975 transitions. [2019-09-08 04:12:49,868 INFO L78 Accepts]: Start accepts. Automaton has 16664 states and 26975 transitions. Word has length 161 [2019-09-08 04:12:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:49,869 INFO L475 AbstractCegarLoop]: Abstraction has 16664 states and 26975 transitions. [2019-09-08 04:12:49,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16664 states and 26975 transitions. [2019-09-08 04:12:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:12:49,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:49,874 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:12:49,874 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -346833178, now seen corresponding path program 1 times [2019-09-08 04:12:49,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:12:50,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:50,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:50,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:50,017 INFO L87 Difference]: Start difference. First operand 16664 states and 26975 transitions. Second operand 4 states. [2019-09-08 04:12:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:50,667 INFO L93 Difference]: Finished difference Result 32983 states and 54073 transitions. [2019-09-08 04:12:50,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:50,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-08 04:12:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:50,808 INFO L225 Difference]: With dead ends: 32983 [2019-09-08 04:12:50,808 INFO L226 Difference]: Without dead ends: 16341 [2019-09-08 04:12:50,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16341 states. [2019-09-08 04:12:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16341 to 16257. [2019-09-08 04:12:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16257 states. [2019-09-08 04:12:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16257 states to 16257 states and 26261 transitions. [2019-09-08 04:12:51,821 INFO L78 Accepts]: Start accepts. Automaton has 16257 states and 26261 transitions. Word has length 162 [2019-09-08 04:12:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:51,821 INFO L475 AbstractCegarLoop]: Abstraction has 16257 states and 26261 transitions. [2019-09-08 04:12:51,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:12:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 16257 states and 26261 transitions. [2019-09-08 04:12:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 04:12:51,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:51,826 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:12:51,826 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash 268433047, now seen corresponding path program 1 times [2019-09-08 04:12:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:51,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:51,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 04:12:51,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:12:51,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:12:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:12:51,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:12:51,959 INFO L87 Difference]: Start difference. First operand 16257 states and 26261 transitions. Second operand 7 states. [2019-09-08 04:12:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:55,285 INFO L93 Difference]: Finished difference Result 48811 states and 81198 transitions. [2019-09-08 04:12:55,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:12:55,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-09-08 04:12:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:55,561 INFO L225 Difference]: With dead ends: 48811 [2019-09-08 04:12:55,561 INFO L226 Difference]: Without dead ends: 32588 [2019-09-08 04:12:55,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:12:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32588 states. [2019-09-08 04:12:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32588 to 32388. [2019-09-08 04:12:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32388 states. [2019-09-08 04:12:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32388 states to 32388 states and 53529 transitions. [2019-09-08 04:12:58,129 INFO L78 Accepts]: Start accepts. Automaton has 32388 states and 53529 transitions. Word has length 171 [2019-09-08 04:12:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:12:58,130 INFO L475 AbstractCegarLoop]: Abstraction has 32388 states and 53529 transitions. [2019-09-08 04:12:58,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:12:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 32388 states and 53529 transitions. [2019-09-08 04:12:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 04:12:58,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:12:58,135 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-08 04:12:58,136 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:12:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:12:58,136 INFO L82 PathProgramCache]: Analyzing trace with hash -444692031, now seen corresponding path program 1 times [2019-09-08 04:12:58,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:12:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:12:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:12:58,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:12:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:12:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:12:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:12:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:12:58,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:12:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:12:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:12:58,248 INFO L87 Difference]: Start difference. First operand 32388 states and 53529 transitions. Second operand 4 states. [2019-09-08 04:12:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:12:59,383 INFO L93 Difference]: Finished difference Result 64489 states and 108496 transitions. [2019-09-08 04:12:59,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:12:59,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-09-08 04:12:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:12:59,574 INFO L225 Difference]: With dead ends: 64489 [2019-09-08 04:12:59,574 INFO L226 Difference]: Without dead ends: 32123 [2019-09-08 04:12:59,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:12:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32123 states. [2019-09-08 04:13:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32123 to 31991. [2019-09-08 04:13:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-09-08 04:13:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 52768 transitions. [2019-09-08 04:13:01,029 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 52768 transitions. Word has length 172 [2019-09-08 04:13:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:01,030 INFO L475 AbstractCegarLoop]: Abstraction has 31991 states and 52768 transitions. [2019-09-08 04:13:01,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:13:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 52768 transitions. [2019-09-08 04:13:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 04:13:01,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:01,035 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-09-08 04:13:01,036 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 336748450, now seen corresponding path program 1 times [2019-09-08 04:13:01,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:01,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:13:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:13:01,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:13:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:13:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:13:01,165 INFO L87 Difference]: Start difference. First operand 31991 states and 52768 transitions. Second operand 7 states. [2019-09-08 04:13:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:07,002 INFO L93 Difference]: Finished difference Result 96209 states and 165465 transitions. [2019-09-08 04:13:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:13:07,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 04:13:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:07,348 INFO L225 Difference]: With dead ends: 96209 [2019-09-08 04:13:07,348 INFO L226 Difference]: Without dead ends: 64252 [2019-09-08 04:13:07,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:13:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64252 states. [2019-09-08 04:13:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64252 to 63936. [2019-09-08 04:13:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63936 states. [2019-09-08 04:13:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63936 states to 63936 states and 109681 transitions. [2019-09-08 04:13:10,593 INFO L78 Accepts]: Start accepts. Automaton has 63936 states and 109681 transitions. Word has length 182 [2019-09-08 04:13:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:10,593 INFO L475 AbstractCegarLoop]: Abstraction has 63936 states and 109681 transitions. [2019-09-08 04:13:10,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:13:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 63936 states and 109681 transitions. [2019-09-08 04:13:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 04:13:10,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:10,599 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-09-08 04:13:10,600 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash 129820254, now seen corresponding path program 1 times [2019-09-08 04:13:10,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:10,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:10,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:10,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 04:13:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:13:10,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:13:10,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:13:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:13:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:13:10,716 INFO L87 Difference]: Start difference. First operand 63936 states and 109681 transitions. Second operand 4 states. [2019-09-08 04:13:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:14,579 INFO L93 Difference]: Finished difference Result 127388 states and 224749 transitions. [2019-09-08 04:13:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:13:14,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-09-08 04:13:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:14,901 INFO L225 Difference]: With dead ends: 127388 [2019-09-08 04:13:14,902 INFO L226 Difference]: Without dead ends: 63468 [2019-09-08 04:13:15,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:13:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63468 states. [2019-09-08 04:13:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63468 to 63200. [2019-09-08 04:13:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63200 states. [2019-09-08 04:13:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63200 states to 63200 states and 108176 transitions. [2019-09-08 04:13:17,361 INFO L78 Accepts]: Start accepts. Automaton has 63200 states and 108176 transitions. Word has length 183 [2019-09-08 04:13:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:17,362 INFO L475 AbstractCegarLoop]: Abstraction has 63200 states and 108176 transitions. [2019-09-08 04:13:17,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:13:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 63200 states and 108176 transitions. [2019-09-08 04:13:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:13:17,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:17,378 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:17,379 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1899352771, now seen corresponding path program 1 times [2019-09-08 04:13:17,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 04:13:17,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:13:17,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:13:17,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:13:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:18,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 3591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:13:18,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:13:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-08 04:13:18,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:13:18,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:13:18,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:13:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:13:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:13:18,967 INFO L87 Difference]: Start difference. First operand 63200 states and 108176 transitions. Second operand 14 states. [2019-09-08 04:13:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:29,442 INFO L93 Difference]: Finished difference Result 128930 states and 230780 transitions. [2019-09-08 04:13:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:13:29,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 277 [2019-09-08 04:13:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:29,787 INFO L225 Difference]: With dead ends: 128930 [2019-09-08 04:13:29,787 INFO L226 Difference]: Without dead ends: 65764 [2019-09-08 04:13:30,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:13:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65764 states. [2019-09-08 04:13:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65764 to 65352. [2019-09-08 04:13:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65352 states. [2019-09-08 04:13:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65352 states to 65352 states and 112173 transitions. [2019-09-08 04:13:32,525 INFO L78 Accepts]: Start accepts. Automaton has 65352 states and 112173 transitions. Word has length 277 [2019-09-08 04:13:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:32,525 INFO L475 AbstractCegarLoop]: Abstraction has 65352 states and 112173 transitions. [2019-09-08 04:13:32,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:13:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 65352 states and 112173 transitions. [2019-09-08 04:13:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 04:13:32,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:32,548 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:13:32,548 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash -451321085, now seen corresponding path program 1 times [2019-09-08 04:13:32,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-09-08 04:13:32,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:13:32,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:13:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:13:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:33,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 3597 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:13:33,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:13:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 04:13:33,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:13:33,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:13:33,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:13:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:13:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:13:33,435 INFO L87 Difference]: Start difference. First operand 65352 states and 112173 transitions. Second operand 14 states. [2019-09-08 04:13:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:44,824 INFO L93 Difference]: Finished difference Result 133024 states and 237221 transitions. [2019-09-08 04:13:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:13:44,826 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 284 [2019-09-08 04:13:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:45,141 INFO L225 Difference]: With dead ends: 133024 [2019-09-08 04:13:45,142 INFO L226 Difference]: Without dead ends: 67706 [2019-09-08 04:13:45,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:13:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67706 states. [2019-09-08 04:13:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67706 to 66592. [2019-09-08 04:13:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66592 states. [2019-09-08 04:13:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66592 states to 66592 states and 113921 transitions. [2019-09-08 04:13:47,789 INFO L78 Accepts]: Start accepts. Automaton has 66592 states and 113921 transitions. Word has length 284 [2019-09-08 04:13:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:13:47,789 INFO L475 AbstractCegarLoop]: Abstraction has 66592 states and 113921 transitions. [2019-09-08 04:13:47,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:13:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 66592 states and 113921 transitions. [2019-09-08 04:13:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-08 04:13:47,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:13:47,805 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:13:47,805 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:13:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:13:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1540010094, now seen corresponding path program 1 times [2019-09-08 04:13:47,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:13:47,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:13:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:47,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:13:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-09-08 04:13:48,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:13:48,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:13:48,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:13:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:13:48,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 4439 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:13:48,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:13:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-09-08 04:13:48,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:13:48,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:13:48,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:13:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:13:48,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:13:48,865 INFO L87 Difference]: Start difference. First operand 66592 states and 113921 transitions. Second operand 14 states. [2019-09-08 04:13:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:13:57,819 INFO L93 Difference]: Finished difference Result 135454 states and 240281 transitions. [2019-09-08 04:13:57,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:13:57,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 445 [2019-09-08 04:13:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:13:58,221 INFO L225 Difference]: With dead ends: 135454 [2019-09-08 04:13:58,222 INFO L226 Difference]: Without dead ends: 68896 [2019-09-08 04:13:59,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:13:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68896 states. [2019-09-08 04:14:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68896 to 67768. [2019-09-08 04:14:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67768 states. [2019-09-08 04:14:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67768 states to 67768 states and 115573 transitions. [2019-09-08 04:14:05,902 INFO L78 Accepts]: Start accepts. Automaton has 67768 states and 115573 transitions. Word has length 445 [2019-09-08 04:14:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:14:05,902 INFO L475 AbstractCegarLoop]: Abstraction has 67768 states and 115573 transitions. [2019-09-08 04:14:05,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:14:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 67768 states and 115573 transitions. [2019-09-08 04:14:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-09-08 04:14:05,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:14:05,923 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:14:05,924 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:14:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:14:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash 175947842, now seen corresponding path program 1 times [2019-09-08 04:14:05,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:14:05,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:14:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:05,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:05,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-08 04:14:06,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:14:06,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:14:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:06,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 4443 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:14:06,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:14:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-09-08 04:14:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:14:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 04:14:07,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:14:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:14:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:14:07,027 INFO L87 Difference]: Start difference. First operand 67768 states and 115573 transitions. Second operand 14 states. [2019-09-08 04:14:17,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:14:17,464 INFO L93 Difference]: Finished difference Result 138004 states and 243575 transitions. [2019-09-08 04:14:17,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:14:17,464 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 449 [2019-09-08 04:14:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:14:17,826 INFO L225 Difference]: With dead ends: 138004 [2019-09-08 04:14:17,827 INFO L226 Difference]: Without dead ends: 70270 [2019-09-08 04:14:18,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 457 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:14:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70270 states. [2019-09-08 04:14:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70270 to 68912. [2019-09-08 04:14:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68912 states. [2019-09-08 04:14:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68912 states to 68912 states and 117177 transitions. [2019-09-08 04:14:20,969 INFO L78 Accepts]: Start accepts. Automaton has 68912 states and 117177 transitions. Word has length 449 [2019-09-08 04:14:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:14:20,970 INFO L475 AbstractCegarLoop]: Abstraction has 68912 states and 117177 transitions. [2019-09-08 04:14:20,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:14:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 68912 states and 117177 transitions. [2019-09-08 04:14:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 04:14:20,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:14:20,982 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:14:20,982 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:14:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:14:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1503156796, now seen corresponding path program 1 times [2019-09-08 04:14:20,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:14:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:14:20,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:20,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:20,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-09-08 04:14:21,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:14:21,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:14:21,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:14:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:21,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 3606 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 04:14:21,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:14:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 04:14:21,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:14:21,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2019-09-08 04:14:21,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:14:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:14:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:14:21,857 INFO L87 Difference]: Start difference. First operand 68912 states and 117177 transitions. Second operand 13 states. [2019-09-08 04:14:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:14:39,208 INFO L93 Difference]: Finished difference Result 193143 states and 338096 transitions. [2019-09-08 04:14:39,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 04:14:39,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 293 [2019-09-08 04:14:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:14:39,879 INFO L225 Difference]: With dead ends: 193143 [2019-09-08 04:14:39,880 INFO L226 Difference]: Without dead ends: 133827 [2019-09-08 04:14:41,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 04:14:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133827 states. [2019-09-08 04:14:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133827 to 128536. [2019-09-08 04:14:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128536 states. [2019-09-08 04:14:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128536 states to 128536 states and 220713 transitions. [2019-09-08 04:14:51,091 INFO L78 Accepts]: Start accepts. Automaton has 128536 states and 220713 transitions. Word has length 293 [2019-09-08 04:14:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:14:51,092 INFO L475 AbstractCegarLoop]: Abstraction has 128536 states and 220713 transitions. [2019-09-08 04:14:51,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:14:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 128536 states and 220713 transitions. [2019-09-08 04:14:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 04:14:51,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:14:51,105 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:14:51,105 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:14:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:14:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash -548409216, now seen corresponding path program 1 times [2019-09-08 04:14:51,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:14:51,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:14:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:51,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:14:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:14:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2019-09-08 04:14:51,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:14:51,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:14:51,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:14:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:14:52,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 4434 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:14:52,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:14:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-09-08 04:14:52,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:14:52,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 04:14:52,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:14:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:14:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:14:52,596 INFO L87 Difference]: Start difference. First operand 128536 states and 220713 transitions. Second operand 6 states. [2019-09-08 04:15:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:15:01,707 INFO L93 Difference]: Finished difference Result 258011 states and 458174 transitions. [2019-09-08 04:15:01,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:15:01,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 455 [2019-09-08 04:15:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:15:02,910 INFO L225 Difference]: With dead ends: 258011 [2019-09-08 04:15:02,910 INFO L226 Difference]: Without dead ends: 129377 [2019-09-08 04:15:03,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:15:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129377 states. [2019-09-08 04:15:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129377 to 129239. [2019-09-08 04:15:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129239 states. [2019-09-08 04:15:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129239 states to 129239 states and 220952 transitions. [2019-09-08 04:15:16,967 INFO L78 Accepts]: Start accepts. Automaton has 129239 states and 220952 transitions. Word has length 455 [2019-09-08 04:15:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:15:16,967 INFO L475 AbstractCegarLoop]: Abstraction has 129239 states and 220952 transitions. [2019-09-08 04:15:16,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:15:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 129239 states and 220952 transitions. [2019-09-08 04:15:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 04:15:16,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:15:16,986 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,986 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:15:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:15:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1747070516, now seen corresponding path program 1 times [2019-09-08 04:15:16,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:15:16,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:15:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:16,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:15:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:15:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 25 proven. 52 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-08 04:15:17,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:15:17,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:15:17,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:15:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:15:17,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 3752 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:15:17,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:15:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 04:15:17,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:15:17,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2019-09-08 04:15:17,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:15:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:15:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:15:17,913 INFO L87 Difference]: Start difference. First operand 129239 states and 220952 transitions. Second operand 14 states. [2019-09-08 04:16:13,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:16:13,388 INFO L93 Difference]: Finished difference Result 641915 states and 1290210 transitions. [2019-09-08 04:16:13,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-08 04:16:13,389 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 339 [2019-09-08 04:16:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:16:17,277 INFO L225 Difference]: With dead ends: 641915 [2019-09-08 04:16:17,277 INFO L226 Difference]: Without dead ends: 501934 [2019-09-08 04:16:29,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=638, Invalid=3394, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 04:16:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501934 states. [2019-09-08 04:17:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501934 to 479635. [2019-09-08 04:17:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479635 states. [2019-09-08 04:17:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479635 states to 479635 states and 816256 transitions. [2019-09-08 04:17:23,759 INFO L78 Accepts]: Start accepts. Automaton has 479635 states and 816256 transitions. Word has length 339 [2019-09-08 04:17:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:17:23,760 INFO L475 AbstractCegarLoop]: Abstraction has 479635 states and 816256 transitions. [2019-09-08 04:17:23,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:17:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 479635 states and 816256 transitions. [2019-09-08 04:17:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-09-08 04:17:23,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:17:23,785 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 04:17:23,785 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:17:23,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:17:23,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1115256098, now seen corresponding path program 1 times [2019-09-08 04:17:23,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:17:23,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:17:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:23,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:17:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:17:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 22 proven. 47 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-09-08 04:17:26,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:17:26,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:17:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:17:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:17:26,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 4611 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 04:17:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:17:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 323 proven. 2 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2019-09-08 04:17:27,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:17:27,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-08 04:17:27,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:17:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:17:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:17:27,086 INFO L87 Difference]: Start difference. First operand 479635 states and 816256 transitions. Second operand 24 states. [2019-09-08 04:19:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:36,360 INFO L93 Difference]: Finished difference Result 1283572 states and 2379786 transitions. [2019-09-08 04:19:36,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:19:36,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 512 [2019-09-08 04:19:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:44,385 INFO L225 Difference]: With dead ends: 1283572 [2019-09-08 04:19:44,385 INFO L226 Difference]: Without dead ends: 803914