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_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:19:16,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:19:16,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:19:16,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:19:16,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:19:16,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:19:16,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:19:16,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:19:16,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:19:16,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:19:16,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:19:16,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:19:16,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:19:16,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:19:16,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:19:16,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:19:16,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:19:16,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:19:16,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:19:16,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:19:16,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:19:16,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:19:16,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:19:16,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:19:16,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:19:16,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:19:16,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:19:16,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:19:16,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:19:16,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:19:16,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:19:16,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:19:16,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:19:16,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:19:16,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:19:16,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:19:16,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:19:16,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:19:16,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:19:16,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:19:16,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:19:16,999 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:19:17,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:19:17,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:19:17,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:19:17,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:19:17,015 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:19:17,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:19:17,015 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:19:17,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:19:17,016 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:19:17,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:19:17,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:19:17,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:19:17,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:19:17,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:19:17,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:19:17,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:19:17,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:19:17,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:19:17,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:19:17,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:19:17,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:19:17,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:19:17,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:19:17,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:19:17,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:19:17,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:19:17,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:19:17,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:19:17,076 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:19:17,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product28.cil.c [2019-09-08 04:19:17,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8356760/3576d75623e54e369984641e5a4e1e94/FLAG6037e6a70 [2019-09-08 04:19:17,783 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:19:17,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product28.cil.c [2019-09-08 04:19:17,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8356760/3576d75623e54e369984641e5a4e1e94/FLAG6037e6a70 [2019-09-08 04:19:18,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8356760/3576d75623e54e369984641e5a4e1e94 [2019-09-08 04:19:18,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:19:18,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:19:18,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:19:18,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:19:18,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:19:18,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:19:18" (1/1) ... [2019-09-08 04:19:18,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b29847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:18, skipping insertion in model container [2019-09-08 04:19:18,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:19:18" (1/1) ... [2019-09-08 04:19:18,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:19:18,160 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:19:18,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:19:18,894 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:19:19,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:19:19,140 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:19:19,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19 WrapperNode [2019-09-08 04:19:19,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:19:19,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:19:19,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:19:19,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:19:19,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (1/1) ... [2019-09-08 04:19:19,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:19:19,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:19:19,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:19:19,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:19:19,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19: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:19:19,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:19:19,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:19:19,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:19:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:19:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:19:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:19:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:19:19,397 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:19:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:19:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:19:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:19:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:19:19,398 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:19:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:19:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:19:19,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:19:19,401 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:19:19,402 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:19:19,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:19:19,402 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:19:19,402 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:19:19,402 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:19:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:19:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:19:19,403 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:19:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:19:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:19:19,406 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 04:19:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:19:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:19:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:19:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:19:19,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:19:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:19:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:19:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:19:19,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:19:19,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:19:19,409 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:19:19,409 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:19:19,410 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:19:19,411 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:19:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:19:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:19:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:19:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:19:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:19:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:19:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:19:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:19:19,413 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:19:19,414 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:19:19,414 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:19:19,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:19:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:19:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:19:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:19:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:19:19,415 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:19:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:19:19,416 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:19:19,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:19:19,417 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:19:19,418 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:19:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:19:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:19:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:19:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:19:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:19:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:19:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-09-08 04:19:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-09-08 04:19:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:19:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:19:19,421 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:19:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:19:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:19:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:19:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:19:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:19:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:19:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:19:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:19:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:19:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:19:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:19:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:19:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:19:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:19:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:19:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:19:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:19:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:19:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:19:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:19:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 04:19:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 04:19:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:19:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:19:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:19:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:19:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:19:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:19:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:19:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:19:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:19:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:19:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:19:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:19:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:19:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:19:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:19:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:19:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:19:19,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:19:19,436 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:19:19,436 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:19:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:19:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:19:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:19:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:19:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:19:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:19:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:19:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:19:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:19:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:19:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:19:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:19:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:19:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:19:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:19:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:19:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:19:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:19:21,545 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:19:21,546 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:19:21,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:19:21 BoogieIcfgContainer [2019-09-08 04:19:21,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:19:21,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:19:21,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:19:21,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:19:21,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:19:18" (1/3) ... [2019-09-08 04:19:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b2f53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:19:21, skipping insertion in model container [2019-09-08 04:19:21,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:19:19" (2/3) ... [2019-09-08 04:19:21,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b2f53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:19:21, skipping insertion in model container [2019-09-08 04:19:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:19:21" (3/3) ... [2019-09-08 04:19:21,557 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product28.cil.c [2019-09-08 04:19:21,567 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:19:21,585 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:19:21,604 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:19:21,657 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:19:21,658 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:19:21,658 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:19:21,658 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:19:21,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:19:21,659 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:19:21,659 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:19:21,659 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:19:21,659 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:19:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states. [2019-09-08 04:19:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:19:21,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:21,724 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:21,727 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1927707397, now seen corresponding path program 1 times [2019-09-08 04:19:21,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:21,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:21,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:22,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:22,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:22,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:22,428 INFO L87 Difference]: Start difference. First operand 825 states. Second operand 7 states. [2019-09-08 04:19:22,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:22,801 INFO L93 Difference]: Finished difference Result 1315 states and 2110 transitions. [2019-09-08 04:19:22,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:19:22,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-09-08 04:19:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:22,839 INFO L225 Difference]: With dead ends: 1315 [2019-09-08 04:19:22,839 INFO L226 Difference]: Without dead ends: 666 [2019-09-08 04:19:22,852 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:19:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-08 04:19:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-09-08 04:19:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-08 04:19:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1050 transitions. [2019-09-08 04:19:22,990 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1050 transitions. Word has length 93 [2019-09-08 04:19:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:22,991 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1050 transitions. [2019-09-08 04:19:22,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1050 transitions. [2019-09-08 04:19:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:19:22,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:22,997 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:22,997 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -385946519, now seen corresponding path program 1 times [2019-09-08 04:19:22,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:22,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:22,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:22,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:22,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:23,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:23,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:19:23,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:19:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:19:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:19:23,168 INFO L87 Difference]: Start difference. First operand 664 states and 1050 transitions. Second operand 4 states. [2019-09-08 04:19:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:23,264 INFO L93 Difference]: Finished difference Result 1294 states and 2065 transitions. [2019-09-08 04:19:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:19:23,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-08 04:19:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:23,275 INFO L225 Difference]: With dead ends: 1294 [2019-09-08 04:19:23,276 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 04:19:23,281 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:19:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 04:19:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-08 04:19:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 04:19:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1017 transitions. [2019-09-08 04:19:23,343 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1017 transitions. Word has length 94 [2019-09-08 04:19:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:23,348 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 1017 transitions. [2019-09-08 04:19:23,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:19:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1017 transitions. [2019-09-08 04:19:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:19:23,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:23,354 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:23,354 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1755116079, now seen corresponding path program 1 times [2019-09-08 04:19:23,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:23,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:23,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:23,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:23,580 INFO L87 Difference]: Start difference. First operand 646 states and 1017 transitions. Second operand 7 states. [2019-09-08 04:19:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:23,734 INFO L93 Difference]: Finished difference Result 1263 states and 2007 transitions. [2019-09-08 04:19:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:19:23,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-09-08 04:19:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:23,739 INFO L225 Difference]: With dead ends: 1263 [2019-09-08 04:19:23,740 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 04:19:23,742 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:19:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 04:19:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-08 04:19:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-08 04:19:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1004 transitions. [2019-09-08 04:19:23,771 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1004 transitions. Word has length 94 [2019-09-08 04:19:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:23,771 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1004 transitions. [2019-09-08 04:19:23,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1004 transitions. [2019-09-08 04:19:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:19:23,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:23,774 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:23,774 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:23,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2113338455, now seen corresponding path program 1 times [2019-09-08 04:19:23,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:23,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:23,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:23,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:23,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:23,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:23,914 INFO L87 Difference]: Start difference. First operand 640 states and 1004 transitions. Second operand 7 states. [2019-09-08 04:19:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:24,009 INFO L93 Difference]: Finished difference Result 1251 states and 1981 transitions. [2019-09-08 04:19:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:19:24,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:19:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:24,014 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 04:19:24,014 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 04:19:24,017 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:19:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 04:19:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-09-08 04:19:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 04:19:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 991 transitions. [2019-09-08 04:19:24,042 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 991 transitions. Word has length 95 [2019-09-08 04:19:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:24,042 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 991 transitions. [2019-09-08 04:19:24,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 991 transitions. [2019-09-08 04:19:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:19:24,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:24,044 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:24,044 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:24,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1806825461, now seen corresponding path program 1 times [2019-09-08 04:19:24,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:24,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:24,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:24,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:24,179 INFO L87 Difference]: Start difference. First operand 634 states and 991 transitions. Second operand 7 states. [2019-09-08 04:19:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:24,269 INFO L93 Difference]: Finished difference Result 1239 states and 1955 transitions. [2019-09-08 04:19:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:19:24,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 04:19:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:24,277 INFO L225 Difference]: With dead ends: 1239 [2019-09-08 04:19:24,277 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:24,282 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:19:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 978 transitions. [2019-09-08 04:19:24,307 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 978 transitions. Word has length 96 [2019-09-08 04:19:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:24,308 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 978 transitions. [2019-09-08 04:19:24,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 978 transitions. [2019-09-08 04:19:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:19:24,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:24,310 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:24,310 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1099200010, now seen corresponding path program 1 times [2019-09-08 04:19:24,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:24,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:24,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:24,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:24,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:24,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:24,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:24,480 INFO L87 Difference]: Start difference. First operand 628 states and 978 transitions. Second operand 7 states. [2019-09-08 04:19:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:24,582 INFO L93 Difference]: Finished difference Result 1227 states and 1929 transitions. [2019-09-08 04:19:24,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:19:24,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-09-08 04:19:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:24,589 INFO L225 Difference]: With dead ends: 1227 [2019-09-08 04:19:24,589 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:24,593 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:19:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 977 transitions. [2019-09-08 04:19:24,627 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 977 transitions. Word has length 96 [2019-09-08 04:19:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:24,627 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 977 transitions. [2019-09-08 04:19:24,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 977 transitions. [2019-09-08 04:19:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:19:24,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:24,630 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:24,630 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash 918010957, now seen corresponding path program 1 times [2019-09-08 04:19:24,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:24,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:24,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:19:24,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:19:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:19:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:19:24,844 INFO L87 Difference]: Start difference. First operand 628 states and 977 transitions. Second operand 5 states. [2019-09-08 04:19:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:24,928 INFO L93 Difference]: Finished difference Result 1226 states and 1926 transitions. [2019-09-08 04:19:24,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:24,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 04:19:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:24,934 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 04:19:24,934 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:24,939 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:19:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 976 transitions. [2019-09-08 04:19:24,964 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 976 transitions. Word has length 97 [2019-09-08 04:19:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:24,964 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 976 transitions. [2019-09-08 04:19:24,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:19:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 976 transitions. [2019-09-08 04:19:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:19:24,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:24,968 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:24,968 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1933004815, now seen corresponding path program 1 times [2019-09-08 04:19:24,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:25,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:25,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:19:25,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:19:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:19:25,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:19:25,114 INFO L87 Difference]: Start difference. First operand 628 states and 976 transitions. Second operand 5 states. [2019-09-08 04:19:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:25,180 INFO L93 Difference]: Finished difference Result 1226 states and 1924 transitions. [2019-09-08 04:19:25,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:25,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 04:19:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:25,186 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 04:19:25,186 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:25,189 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:19:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 975 transitions. [2019-09-08 04:19:25,212 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 975 transitions. Word has length 98 [2019-09-08 04:19:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:25,212 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 975 transitions. [2019-09-08 04:19:25,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:19:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 975 transitions. [2019-09-08 04:19:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:19:25,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:25,214 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:25,215 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 432757288, now seen corresponding path program 1 times [2019-09-08 04:19:25,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:25,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:25,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:19:25,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:19:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:19:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:19:25,330 INFO L87 Difference]: Start difference. First operand 628 states and 975 transitions. Second operand 5 states. [2019-09-08 04:19:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:25,391 INFO L93 Difference]: Finished difference Result 1226 states and 1922 transitions. [2019-09-08 04:19:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:25,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 04:19:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:25,396 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 04:19:25,397 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:25,400 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:19:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 974 transitions. [2019-09-08 04:19:25,422 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 974 transitions. Word has length 99 [2019-09-08 04:19:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:25,422 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 974 transitions. [2019-09-08 04:19:25,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:19:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 974 transitions. [2019-09-08 04:19:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 04:19:25,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:25,425 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:25,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1309876268, now seen corresponding path program 1 times [2019-09-08 04:19:25,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:25,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:25,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:25,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:19:25,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:19:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:19:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:19:25,579 INFO L87 Difference]: Start difference. First operand 628 states and 974 transitions. Second operand 5 states. [2019-09-08 04:19:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:25,640 INFO L93 Difference]: Finished difference Result 1226 states and 1920 transitions. [2019-09-08 04:19:25,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:25,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 04:19:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:25,646 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 04:19:25,646 INFO L226 Difference]: Without dead ends: 628 [2019-09-08 04:19:25,649 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:19:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-09-08 04:19:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-09-08 04:19:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 04:19:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 973 transitions. [2019-09-08 04:19:25,671 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 973 transitions. Word has length 100 [2019-09-08 04:19:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:25,671 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 973 transitions. [2019-09-08 04:19:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:19:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 973 transitions. [2019-09-08 04:19:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 04:19:25,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:25,674 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:25,674 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1011268605, now seen corresponding path program 1 times [2019-09-08 04:19:25,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-08 04:19:25,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:19:25,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:19:25,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:26,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:19:26,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:19:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:19:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:19:26,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:19:26,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:19:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:19:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:19:26,407 INFO L87 Difference]: Start difference. First operand 628 states and 973 transitions. Second operand 12 states. [2019-09-08 04:19:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:33,154 INFO L93 Difference]: Finished difference Result 3533 states and 5707 transitions. [2019-09-08 04:19:33,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:19:33,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-09-08 04:19:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:33,177 INFO L225 Difference]: With dead ends: 3533 [2019-09-08 04:19:33,178 INFO L226 Difference]: Without dead ends: 2939 [2019-09-08 04:19:33,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:19:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-09-08 04:19:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2805. [2019-09-08 04:19:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-09-08 04:19:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4464 transitions. [2019-09-08 04:19:33,330 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4464 transitions. Word has length 101 [2019-09-08 04:19:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:33,331 INFO L475 AbstractCegarLoop]: Abstraction has 2805 states and 4464 transitions. [2019-09-08 04:19:33,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:19:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4464 transitions. [2019-09-08 04:19:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 04:19:33,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:33,333 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:33,333 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash 522332344, now seen corresponding path program 1 times [2019-09-08 04:19:33,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:33,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:33,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:33,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:33,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:33,482 INFO L87 Difference]: Start difference. First operand 2805 states and 4464 transitions. Second operand 7 states. [2019-09-08 04:19:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:36,427 INFO L93 Difference]: Finished difference Result 8321 states and 13635 transitions. [2019-09-08 04:19:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:19:36,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-08 04:19:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:36,476 INFO L225 Difference]: With dead ends: 8321 [2019-09-08 04:19:36,476 INFO L226 Difference]: Without dead ends: 5550 [2019-09-08 04:19:36,497 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:19:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2019-09-08 04:19:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5454. [2019-09-08 04:19:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5454 states. [2019-09-08 04:19:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 8795 transitions. [2019-09-08 04:19:36,784 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 8795 transitions. Word has length 105 [2019-09-08 04:19:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:36,785 INFO L475 AbstractCegarLoop]: Abstraction has 5454 states and 8795 transitions. [2019-09-08 04:19:36,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 8795 transitions. [2019-09-08 04:19:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 04:19:36,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:36,787 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:36,788 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:36,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -315840998, now seen corresponding path program 1 times [2019-09-08 04:19:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:36,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:37,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:37,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:19:37,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:19:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:19:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:19:37,113 INFO L87 Difference]: Start difference. First operand 5454 states and 8795 transitions. Second operand 8 states. [2019-09-08 04:19:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:40,347 INFO L93 Difference]: Finished difference Result 17886 states and 29042 transitions. [2019-09-08 04:19:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:19:40,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 04:19:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:40,513 INFO L225 Difference]: With dead ends: 17886 [2019-09-08 04:19:40,513 INFO L226 Difference]: Without dead ends: 12466 [2019-09-08 04:19:40,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:19:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12466 states. [2019-09-08 04:19:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12466 to 8376. [2019-09-08 04:19:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8376 states. [2019-09-08 04:19:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8376 states to 8376 states and 13322 transitions. [2019-09-08 04:19:41,073 INFO L78 Accepts]: Start accepts. Automaton has 8376 states and 13322 transitions. Word has length 102 [2019-09-08 04:19:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:41,074 INFO L475 AbstractCegarLoop]: Abstraction has 8376 states and 13322 transitions. [2019-09-08 04:19:41,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:19:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8376 states and 13322 transitions. [2019-09-08 04:19:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 04:19:41,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:41,076 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:41,076 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 30313455, now seen corresponding path program 1 times [2019-09-08 04:19:41,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:41,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:19:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:41,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:19:41,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:19:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:19:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:19:41,208 INFO L87 Difference]: Start difference. First operand 8376 states and 13322 transitions. Second operand 4 states. [2019-09-08 04:19:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:41,535 INFO L93 Difference]: Finished difference Result 16317 states and 26219 transitions. [2019-09-08 04:19:41,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:41,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 04:19:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:41,585 INFO L225 Difference]: With dead ends: 16317 [2019-09-08 04:19:41,585 INFO L226 Difference]: Without dead ends: 7963 [2019-09-08 04:19:41,629 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:19:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7963 states. [2019-09-08 04:19:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7963 to 7941. [2019-09-08 04:19:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7941 states. [2019-09-08 04:19:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7941 states to 7941 states and 12603 transitions. [2019-09-08 04:19:42,860 INFO L78 Accepts]: Start accepts. Automaton has 7941 states and 12603 transitions. Word has length 105 [2019-09-08 04:19:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:42,861 INFO L475 AbstractCegarLoop]: Abstraction has 7941 states and 12603 transitions. [2019-09-08 04:19:42,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:19:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7941 states and 12603 transitions. [2019-09-08 04:19:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 04:19:42,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:42,863 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:42,863 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1061987221, now seen corresponding path program 1 times [2019-09-08 04:19:42,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:42,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:42,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 04:19:43,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:43,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:43,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:43,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:43,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:43,039 INFO L87 Difference]: Start difference. First operand 7941 states and 12603 transitions. Second operand 7 states. [2019-09-08 04:19:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:46,252 INFO L93 Difference]: Finished difference Result 23747 states and 38844 transitions. [2019-09-08 04:19:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:19:46,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-09-08 04:19:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:46,358 INFO L225 Difference]: With dead ends: 23747 [2019-09-08 04:19:46,358 INFO L226 Difference]: Without dead ends: 15840 [2019-09-08 04:19:46,389 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:19:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15840 states. [2019-09-08 04:19:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15840 to 15716. [2019-09-08 04:19:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15716 states. [2019-09-08 04:19:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15716 states to 15716 states and 25422 transitions. [2019-09-08 04:19:47,074 INFO L78 Accepts]: Start accepts. Automaton has 15716 states and 25422 transitions. Word has length 113 [2019-09-08 04:19:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:47,075 INFO L475 AbstractCegarLoop]: Abstraction has 15716 states and 25422 transitions. [2019-09-08 04:19:47,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15716 states and 25422 transitions. [2019-09-08 04:19:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 04:19:47,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:47,078 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:19:47,078 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1342674105, now seen corresponding path program 1 times [2019-09-08 04:19:47,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:47,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:47,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:47,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:19:47,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:47,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:19:47,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:19:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:19:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:19:47,203 INFO L87 Difference]: Start difference. First operand 15716 states and 25422 transitions. Second operand 4 states. [2019-09-08 04:19:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:47,849 INFO L93 Difference]: Finished difference Result 31047 states and 50789 transitions. [2019-09-08 04:19:47,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:47,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 04:19:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:48,005 INFO L225 Difference]: With dead ends: 31047 [2019-09-08 04:19:48,006 INFO L226 Difference]: Without dead ends: 15353 [2019-09-08 04:19:48,334 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:19:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15353 states. [2019-09-08 04:19:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15353 to 15313. [2019-09-08 04:19:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15313 states. [2019-09-08 04:19:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15313 states to 15313 states and 24722 transitions. [2019-09-08 04:19:48,926 INFO L78 Accepts]: Start accepts. Automaton has 15313 states and 24722 transitions. Word has length 114 [2019-09-08 04:19:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:48,926 INFO L475 AbstractCegarLoop]: Abstraction has 15313 states and 24722 transitions. [2019-09-08 04:19:48,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:19:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 15313 states and 24722 transitions. [2019-09-08 04:19:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 04:19:48,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:48,928 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:19:48,929 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 786190893, now seen corresponding path program 1 times [2019-09-08 04:19:48,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:48,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:48,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:19:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:49,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:49,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:49,081 INFO L87 Difference]: Start difference. First operand 15313 states and 24722 transitions. Second operand 7 states. [2019-09-08 04:19:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:52,452 INFO L93 Difference]: Finished difference Result 45979 states and 77211 transitions. [2019-09-08 04:19:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:19:52,453 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2019-09-08 04:19:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:52,682 INFO L225 Difference]: With dead ends: 45979 [2019-09-08 04:19:52,682 INFO L226 Difference]: Without dead ends: 30700 [2019-09-08 04:19:52,750 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:19:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30700 states. [2019-09-08 04:19:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30700 to 30516. [2019-09-08 04:19:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30516 states. [2019-09-08 04:19:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30516 states to 30516 states and 50860 transitions. [2019-09-08 04:19:54,956 INFO L78 Accepts]: Start accepts. Automaton has 30516 states and 50860 transitions. Word has length 123 [2019-09-08 04:19:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:54,957 INFO L475 AbstractCegarLoop]: Abstraction has 30516 states and 50860 transitions. [2019-09-08 04:19:54,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:19:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30516 states and 50860 transitions. [2019-09-08 04:19:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 04:19:54,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:54,959 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:19:54,959 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 19325943, now seen corresponding path program 1 times [2019-09-08 04:19:54,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:54,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 04:19:55,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:55,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:19:55,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:19:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:19:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:19:55,064 INFO L87 Difference]: Start difference. First operand 30516 states and 50860 transitions. Second operand 4 states. [2019-09-08 04:19:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:19:56,217 INFO L93 Difference]: Finished difference Result 60697 states and 102684 transitions. [2019-09-08 04:19:56,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:19:56,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-08 04:19:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:19:56,660 INFO L225 Difference]: With dead ends: 60697 [2019-09-08 04:19:56,661 INFO L226 Difference]: Without dead ends: 30203 [2019-09-08 04:19:56,787 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:19:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30203 states. [2019-09-08 04:19:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30203 to 30127. [2019-09-08 04:19:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30127 states. [2019-09-08 04:19:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30127 states to 30127 states and 50127 transitions. [2019-09-08 04:19:57,901 INFO L78 Accepts]: Start accepts. Automaton has 30127 states and 50127 transitions. Word has length 124 [2019-09-08 04:19:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:19:57,901 INFO L475 AbstractCegarLoop]: Abstraction has 30127 states and 50127 transitions. [2019-09-08 04:19:57,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:19:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30127 states and 50127 transitions. [2019-09-08 04:19:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 04:19:57,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:19:57,903 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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:19:57,903 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:19:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:19:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 675136877, now seen corresponding path program 1 times [2019-09-08 04:19:57,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:19:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:19:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:19:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:19:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:19:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:19:58,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:19:58,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:19:58,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:19:58,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:19:58,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:19:58,033 INFO L87 Difference]: Start difference. First operand 30127 states and 50127 transitions. Second operand 7 states. [2019-09-08 04:20:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:02,563 INFO L93 Difference]: Finished difference Result 90593 states and 159760 transitions. [2019-09-08 04:20:02,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:20:02,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-09-08 04:20:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:02,911 INFO L225 Difference]: With dead ends: 90593 [2019-09-08 04:20:02,912 INFO L226 Difference]: Without dead ends: 60500 [2019-09-08 04:20:03,267 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:20:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60500 states. [2019-09-08 04:20:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60500 to 60216. [2019-09-08 04:20:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60216 states. [2019-09-08 04:20:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60216 states to 60216 states and 105996 transitions. [2019-09-08 04:20:07,744 INFO L78 Accepts]: Start accepts. Automaton has 60216 states and 105996 transitions. Word has length 134 [2019-09-08 04:20:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:07,745 INFO L475 AbstractCegarLoop]: Abstraction has 60216 states and 105996 transitions. [2019-09-08 04:20:07,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:20:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 60216 states and 105996 transitions. [2019-09-08 04:20:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 04:20:07,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:07,747 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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:20:07,747 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2101596929, now seen corresponding path program 1 times [2019-09-08 04:20:07,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:07,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:07,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:07,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:20:07,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:07,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:20:07,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:20:07,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:20:07,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:20:07,896 INFO L87 Difference]: Start difference. First operand 60216 states and 105996 transitions. Second operand 4 states. [2019-09-08 04:20:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:09,599 INFO L93 Difference]: Finished difference Result 119862 states and 215736 transitions. [2019-09-08 04:20:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:20:09,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 04:20:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:12,480 INFO L225 Difference]: With dead ends: 119862 [2019-09-08 04:20:12,481 INFO L226 Difference]: Without dead ends: 59662 [2019-09-08 04:20:12,658 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:20:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59662 states. [2019-09-08 04:20:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59662 to 59518. [2019-09-08 04:20:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59518 states. [2019-09-08 04:20:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59518 states to 59518 states and 104507 transitions. [2019-09-08 04:20:14,738 INFO L78 Accepts]: Start accepts. Automaton has 59518 states and 104507 transitions. Word has length 135 [2019-09-08 04:20:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:14,738 INFO L475 AbstractCegarLoop]: Abstraction has 59518 states and 104507 transitions. [2019-09-08 04:20:14,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:20:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59518 states and 104507 transitions. [2019-09-08 04:20:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:20:14,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:14,740 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 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:20:14,740 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:14,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1005676846, now seen corresponding path program 1 times [2019-09-08 04:20:14,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:14,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:14,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:14,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:14,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:20:14,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:14,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:20:14,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:20:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:20:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:20:14,885 INFO L87 Difference]: Start difference. First operand 59518 states and 104507 transitions. Second operand 3 states. [2019-09-08 04:20:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:16,758 INFO L93 Difference]: Finished difference Result 121799 states and 211614 transitions. [2019-09-08 04:20:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:20:16,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 04:20:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:17,150 INFO L225 Difference]: With dead ends: 121799 [2019-09-08 04:20:17,150 INFO L226 Difference]: Without dead ends: 63534 [2019-09-08 04:20:17,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:20:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63534 states. [2019-09-08 04:20:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63534 to 62960. [2019-09-08 04:20:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62960 states. [2019-09-08 04:20:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62960 states to 62960 states and 110608 transitions. [2019-09-08 04:20:20,326 INFO L78 Accepts]: Start accepts. Automaton has 62960 states and 110608 transitions. Word has length 136 [2019-09-08 04:20:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:20,326 INFO L475 AbstractCegarLoop]: Abstraction has 62960 states and 110608 transitions. [2019-09-08 04:20:20,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:20:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62960 states and 110608 transitions. [2019-09-08 04:20:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 04:20:20,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:20,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:20,330 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:20,331 INFO L82 PathProgramCache]: Analyzing trace with hash -409477017, now seen corresponding path program 1 times [2019-09-08 04:20:20,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:20,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:20:20,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:20:20,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:20:20,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:20:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:20:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:20:20,510 INFO L87 Difference]: Start difference. First operand 62960 states and 110608 transitions. Second operand 10 states. [2019-09-08 04:20:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:24,227 INFO L93 Difference]: Finished difference Result 141755 states and 263493 transitions. [2019-09-08 04:20:24,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:20:24,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 194 [2019-09-08 04:20:24,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:27,935 INFO L225 Difference]: With dead ends: 141755 [2019-09-08 04:20:27,936 INFO L226 Difference]: Without dead ends: 78829 [2019-09-08 04:20:28,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:20:28,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78829 states. [2019-09-08 04:20:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78829 to 78825. [2019-09-08 04:20:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78825 states. [2019-09-08 04:20:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78825 states to 78825 states and 144122 transitions. [2019-09-08 04:20:31,195 INFO L78 Accepts]: Start accepts. Automaton has 78825 states and 144122 transitions. Word has length 194 [2019-09-08 04:20:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:31,196 INFO L475 AbstractCegarLoop]: Abstraction has 78825 states and 144122 transitions. [2019-09-08 04:20:31,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:20:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 78825 states and 144122 transitions. [2019-09-08 04:20:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 04:20:31,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:31,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:20:31,200 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1253304222, now seen corresponding path program 1 times [2019-09-08 04:20:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:20:31,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:20:31,415 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) [2019-09-08 04:20:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:20:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:31,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 3418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 04:20:31,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:20:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:20:31,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:20:31,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 04:20:31,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:20:31,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:20:31,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:20:31,995 INFO L87 Difference]: Start difference. First operand 78825 states and 144122 transitions. Second operand 13 states. [2019-09-08 04:20:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:38,294 INFO L93 Difference]: Finished difference Result 173390 states and 365055 transitions. [2019-09-08 04:20:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:20:38,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 195 [2019-09-08 04:20:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:39,887 INFO L225 Difference]: With dead ends: 173390 [2019-09-08 04:20:39,887 INFO L226 Difference]: Without dead ends: 94599 [2019-09-08 04:20:40,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:20:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94599 states. [2019-09-08 04:20:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94599 to 90043. [2019-09-08 04:20:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90043 states. [2019-09-08 04:20:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90043 states to 90043 states and 163073 transitions. [2019-09-08 04:20:48,986 INFO L78 Accepts]: Start accepts. Automaton has 90043 states and 163073 transitions. Word has length 195 [2019-09-08 04:20:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:20:48,987 INFO L475 AbstractCegarLoop]: Abstraction has 90043 states and 163073 transitions. [2019-09-08 04:20:48,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:20:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 90043 states and 163073 transitions. [2019-09-08 04:20:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-08 04:20:49,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:20:49,024 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, 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, 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:20:49,024 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:20:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:20:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1444788148, now seen corresponding path program 1 times [2019-09-08 04:20:49,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:20:49,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:20:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:20:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 22 proven. 53 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2019-09-08 04:20:49,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:20:49,847 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:20:49,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:20:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:20:50,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 5191 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:20:50,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:20:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-08 04:20:50,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:20:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:20:50,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:20:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:20:50,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:20:50,761 INFO L87 Difference]: Start difference. First operand 90043 states and 163073 transitions. Second operand 15 states. [2019-09-08 04:20:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:20:55,912 INFO L93 Difference]: Finished difference Result 181119 states and 359200 transitions. [2019-09-08 04:20:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:20:55,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 471 [2019-09-08 04:20:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:20:57,353 INFO L225 Difference]: With dead ends: 181119 [2019-09-08 04:20:57,354 INFO L226 Difference]: Without dead ends: 91110 [2019-09-08 04:20:57,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:20:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91110 states. [2019-09-08 04:21:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91110 to 91110. [2019-09-08 04:21:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91110 states. [2019-09-08 04:21:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91110 states to 91110 states and 164002 transitions. [2019-09-08 04:21:06,348 INFO L78 Accepts]: Start accepts. Automaton has 91110 states and 164002 transitions. Word has length 471 [2019-09-08 04:21:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:06,349 INFO L475 AbstractCegarLoop]: Abstraction has 91110 states and 164002 transitions. [2019-09-08 04:21:06,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 91110 states and 164002 transitions. [2019-09-08 04:21:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 04:21:06,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:06,379 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 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, 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:21:06,379 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1983923301, now seen corresponding path program 1 times [2019-09-08 04:21:06,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:06,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:06,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 04:21:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:06,629 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:21:06,644 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:21:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:07,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 4123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 04:21:07,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:07,350 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 04:21:07,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:21:07,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 04:21:07,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:21:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:21:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:21:07,372 INFO L87 Difference]: Start difference. First operand 91110 states and 164002 transitions. Second operand 15 states. [2019-09-08 04:21:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:13,820 INFO L93 Difference]: Finished difference Result 183324 states and 360781 transitions. [2019-09-08 04:21:13,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:21:13,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 307 [2019-09-08 04:21:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:14,357 INFO L225 Difference]: With dead ends: 183324 [2019-09-08 04:21:14,357 INFO L226 Difference]: Without dead ends: 92248 [2019-09-08 04:21:14,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:21:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92248 states. [2019-09-08 04:21:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92248 to 92136. [2019-09-08 04:21:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92136 states. [2019-09-08 04:21:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92136 states to 92136 states and 164950 transitions. [2019-09-08 04:21:19,969 INFO L78 Accepts]: Start accepts. Automaton has 92136 states and 164950 transitions. Word has length 307 [2019-09-08 04:21:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:19,970 INFO L475 AbstractCegarLoop]: Abstraction has 92136 states and 164950 transitions. [2019-09-08 04:21:19,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:21:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 92136 states and 164950 transitions. [2019-09-08 04:21:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 04:21:19,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:19,993 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,993 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -535984547, now seen corresponding path program 1 times [2019-09-08 04:21:19,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 04:21:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:20,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:21:20,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:21:20,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:21:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:21:20,241 INFO L87 Difference]: Start difference. First operand 92136 states and 164950 transitions. Second operand 12 states. [2019-09-08 04:21:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:27,908 INFO L93 Difference]: Finished difference Result 185451 states and 362518 transitions. [2019-09-08 04:21:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:21:27,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 345 [2019-09-08 04:21:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:28,335 INFO L225 Difference]: With dead ends: 185451 [2019-09-08 04:21:28,335 INFO L226 Difference]: Without dead ends: 93349 [2019-09-08 04:21:28,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-08 04:21:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93349 states. [2019-09-08 04:21:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93349 to 93181. [2019-09-08 04:21:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93181 states. [2019-09-08 04:21:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93181 states to 93181 states and 165947 transitions. [2019-09-08 04:21:36,763 INFO L78 Accepts]: Start accepts. Automaton has 93181 states and 165947 transitions. Word has length 345 [2019-09-08 04:21:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:36,764 INFO L475 AbstractCegarLoop]: Abstraction has 93181 states and 165947 transitions. [2019-09-08 04:21:36,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:21:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 93181 states and 165947 transitions. [2019-09-08 04:21:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-08 04:21:36,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:36,783 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 9, 6, 5, 5, 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, 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] [2019-09-08 04:21:36,783 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:36,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1112786118, now seen corresponding path program 1 times [2019-09-08 04:21:36,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:36,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-08 04:21:37,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:21:37,093 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:21:37,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:37,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 5448 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 04:21:37,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:21:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 438 proven. 20 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-09-08 04:21:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:21:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 04:21:38,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:21:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:21:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:21:38,655 INFO L87 Difference]: Start difference. First operand 93181 states and 165947 transitions. Second operand 19 states. [2019-09-08 04:23:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:04,229 INFO L93 Difference]: Finished difference Result 559099 states and 1510631 transitions. [2019-09-08 04:23:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 04:23:04,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 484 [2019-09-08 04:23:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:15,816 INFO L225 Difference]: With dead ends: 559099 [2019-09-08 04:23:15,816 INFO L226 Difference]: Without dead ends: 446704 [2019-09-08 04:23:18,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 519 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1141, Invalid=6515, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 04:23:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446704 states. [2019-09-08 04:23:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446704 to 416099. [2019-09-08 04:23:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416099 states. [2019-09-08 04:24:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416099 states to 416099 states and 825235 transitions. [2019-09-08 04:24:16,468 INFO L78 Accepts]: Start accepts. Automaton has 416099 states and 825235 transitions. Word has length 484 [2019-09-08 04:24:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:16,468 INFO L475 AbstractCegarLoop]: Abstraction has 416099 states and 825235 transitions. [2019-09-08 04:24:16,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:24:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 416099 states and 825235 transitions. [2019-09-08 04:24:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-08 04:24:16,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:16,484 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-09-08 04:24:16,484 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1843036837, now seen corresponding path program 1 times [2019-09-08 04:24:16,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:16,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:16,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:16,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 22 proven. 56 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-09-08 04:24:16,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:24:16,998 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:24:17,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:17,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 5246 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 04:24:17,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:24:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 293 proven. 2 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-09-08 04:24:27,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:24:27,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-08 04:24:27,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:24:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:24:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:24:27,511 INFO L87 Difference]: Start difference. First operand 416099 states and 825235 transitions. Second operand 24 states.