java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:23:38,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:23:38,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:23:38,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:23:38,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:23:38,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:23:38,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:23:38,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:23:38,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:23:38,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:23:38,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:23:38,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:23:38,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:23:38,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:23:38,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:23:38,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:23:38,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:23:38,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:23:38,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:23:38,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:23:38,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:23:38,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:23:38,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:23:38,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:23:38,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:23:38,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:23:38,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:23:38,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:23:38,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:23:38,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:23:38,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:23:38,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:23:38,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:23:38,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:23:38,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:23:38,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:23:38,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:23:38,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:23:38,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:23:38,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:23:38,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:23:38,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:23:38,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:23:38,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:23:38,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:23:38,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:23:38,413 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:23:38,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:23:38,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:23:38,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:23:38,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:23:38,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:23:38,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:23:38,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:23:38,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:23:38,415 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:23:38,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:23:38,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:23:38,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:23:38,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:23:38,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:23:38,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:23:38,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:23:38,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:23:38,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:23:38,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:23:38,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:23:38,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:23:38,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:23:38,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:23:38,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:23:38,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:23:38,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:23:38,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:23:38,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:23:38,475 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:23:38,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-09-08 04:23:38,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1565bba3/90070eb6636f423192a695f8c9ac8e49/FLAGe83d81b3f [2019-09-08 04:23:39,221 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:23:39,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-09-08 04:23:39,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1565bba3/90070eb6636f423192a695f8c9ac8e49/FLAGe83d81b3f [2019-09-08 04:23:39,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1565bba3/90070eb6636f423192a695f8c9ac8e49 [2019-09-08 04:23:39,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:23:39,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:23:39,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:23:39,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:23:39,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:23:39,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:23:39" (1/1) ... [2019-09-08 04:23:39,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1b76c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:39, skipping insertion in model container [2019-09-08 04:23:39,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:23:39" (1/1) ... [2019-09-08 04:23:39,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:23:39,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:23:40,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:23:40,366 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:23:40,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:23:40,600 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:23:40,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40 WrapperNode [2019-09-08 04:23:40,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:23:40,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:23:40,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:23:40,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:23:40,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (1/1) ... [2019-09-08 04:23:40,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:23:40,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:23:40,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:23:40,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:23:40,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (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:23:40,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:23:40,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:23:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:23:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:23:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:23:40,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:23:40,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:23:40,909 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:23:40,909 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:23:40,910 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:23:40,911 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:23:40,911 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:23:40,912 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:23:40,912 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:23:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:23:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:23:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:23:40,915 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:23:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:23:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:23:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:23:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:23:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:23:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:23:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:23:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:23:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:23:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:23:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:23:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:23:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:23:40,919 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:23:40,919 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:23:40,919 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:23:40,919 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:23:40,920 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:23:40,920 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:23:40,920 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:23:40,920 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:23:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:23:40,921 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:23:40,922 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:23:40,922 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:23:40,922 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:23:40,922 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:23:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:23:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:23:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:23:40,923 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:23:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:23:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:23:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:23:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:23:40,924 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:23:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 04:23:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 04:23:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:23:40,925 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:23:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:23:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:23:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:23:40,926 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:23:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:23:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:23:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:23:40,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:23:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:23:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:23:40,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:23:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:23:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:23:40,929 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:23:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:23:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:23:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:23:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:23:40,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:23:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:23:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:23:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:23:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:23:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:23:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:23:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:23:40,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:23:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:23:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:23:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:23:40,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:23:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:23:40,935 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:23:40,936 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:23:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:23:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:23:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:23:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:23:40,937 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:23:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:23:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:23:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:23:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:23:40,938 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:23:40,939 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:23:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:23:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:23:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:23:40,940 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:23:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:23:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:23:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:23:40,941 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:23:40,942 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:23:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:23:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:23:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:23:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:23:40,943 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:23:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:23:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:23:40,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:23:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:23:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:23:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:23:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:23:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:23:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:23:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:23:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:23:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:23:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:23:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:23:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:23:40,959 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:23:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:23:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:23:40,960 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 04:23:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 04:23:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:23:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:23:40,961 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:23:40,962 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:23:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:23:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:23:43,527 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:23:43,527 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:23:43,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:23:43 BoogieIcfgContainer [2019-09-08 04:23:43,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:23:43,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:23:43,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:23:43,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:23:43,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:23:39" (1/3) ... [2019-09-08 04:23:43,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759d028d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:23:43, skipping insertion in model container [2019-09-08 04:23:43,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:23:40" (2/3) ... [2019-09-08 04:23:43,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759d028d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:23:43, skipping insertion in model container [2019-09-08 04:23:43,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:23:43" (3/3) ... [2019-09-08 04:23:43,538 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2019-09-08 04:23:43,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:23:43,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:23:43,579 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:23:43,628 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:23:43,628 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:23:43,629 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:23:43,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:23:43,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:23:43,629 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:23:43,629 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:23:43,629 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:23:43,629 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:23:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-09-08 04:23:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 04:23:43,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:43,713 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:23:43,717 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:43,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash 18579608, now seen corresponding path program 1 times [2019-09-08 04:23:43,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:43,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:43,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:44,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:44,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:44,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:44,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:44,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:44,351 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 4 states. [2019-09-08 04:23:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:44,706 INFO L93 Difference]: Finished difference Result 1217 states and 1959 transitions. [2019-09-08 04:23:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:44,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 04:23:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:44,747 INFO L225 Difference]: With dead ends: 1217 [2019-09-08 04:23:44,747 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 04:23:44,762 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:23:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 04:23:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 04:23:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 04:23:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-09-08 04:23:44,912 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 135 [2019-09-08 04:23:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:44,913 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-09-08 04:23:44,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-09-08 04:23:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 04:23:44,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:44,922 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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:23:44,922 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash -270965621, now seen corresponding path program 1 times [2019-09-08 04:23:44,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:44,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:44,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:45,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:45,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:45,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:45,217 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 4 states. [2019-09-08 04:23:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:45,360 INFO L93 Difference]: Finished difference Result 1197 states and 1920 transitions. [2019-09-08 04:23:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:45,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 04:23:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:45,372 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:23:45,373 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 04:23:45,382 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:23:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 04:23:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 04:23:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 04:23:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 980 transitions. [2019-09-08 04:23:45,443 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 980 transitions. Word has length 138 [2019-09-08 04:23:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:45,444 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 980 transitions. [2019-09-08 04:23:45,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 980 transitions. [2019-09-08 04:23:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:23:45,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:45,453 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:45,453 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 932085763, now seen corresponding path program 1 times [2019-09-08 04:23:45,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:45,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:45,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:45,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:45,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:45,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:45,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:45,702 INFO L87 Difference]: Start difference. First operand 617 states and 980 transitions. Second operand 4 states. [2019-09-08 04:23:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:45,779 INFO L93 Difference]: Finished difference Result 1197 states and 1919 transitions. [2019-09-08 04:23:45,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:45,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 04:23:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:45,785 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:23:45,785 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 04:23:45,789 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:23:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 04:23:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 04:23:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 04:23:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 979 transitions. [2019-09-08 04:23:45,823 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 979 transitions. Word has length 139 [2019-09-08 04:23:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:45,826 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 979 transitions. [2019-09-08 04:23:45,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 979 transitions. [2019-09-08 04:23:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:23:45,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:45,837 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:45,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1674590201, now seen corresponding path program 1 times [2019-09-08 04:23:45,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:45,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:45,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:46,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:46,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:46,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:46,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:46,070 INFO L87 Difference]: Start difference. First operand 617 states and 979 transitions. Second operand 4 states. [2019-09-08 04:23:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:46,160 INFO L93 Difference]: Finished difference Result 1197 states and 1918 transitions. [2019-09-08 04:23:46,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:46,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 04:23:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:46,175 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:23:46,176 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 04:23:46,180 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:23:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 04:23:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 04:23:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 04:23:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-09-08 04:23:46,214 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-09-08 04:23:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:46,216 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-09-08 04:23:46,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-09-08 04:23:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:23:46,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:46,222 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:46,222 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2123729665, now seen corresponding path program 1 times [2019-09-08 04:23:46,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:46,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:46,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:46,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:46,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:46,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:46,359 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-09-08 04:23:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:46,414 INFO L93 Difference]: Finished difference Result 1197 states and 1917 transitions. [2019-09-08 04:23:46,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:46,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-08 04:23:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:46,420 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 04:23:46,420 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 04:23:46,424 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:23:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 04:23:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 04:23:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 04:23:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 977 transitions. [2019-09-08 04:23:46,450 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 977 transitions. Word has length 141 [2019-09-08 04:23:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:46,450 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 977 transitions. [2019-09-08 04:23:46,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 977 transitions. [2019-09-08 04:23:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:23:46,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:46,458 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:46,458 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash -113747069, now seen corresponding path program 1 times [2019-09-08 04:23:46,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:46,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:46,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:46,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:23:46,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:23:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:23:46,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:23:46,717 INFO L87 Difference]: Start difference. First operand 617 states and 977 transitions. Second operand 10 states. [2019-09-08 04:23:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:46,879 INFO L93 Difference]: Finished difference Result 1155 states and 1837 transitions. [2019-09-08 04:23:46,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:23:46,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-09-08 04:23:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:46,889 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 04:23:46,890 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 04:23:46,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:23:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 04:23:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-09-08 04:23:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 04:23:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 986 transitions. [2019-09-08 04:23:46,928 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 986 transitions. Word has length 142 [2019-09-08 04:23:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:46,930 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 986 transitions. [2019-09-08 04:23:46,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:23:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 986 transitions. [2019-09-08 04:23:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:23:46,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:46,937 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:46,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1722095778, now seen corresponding path program 1 times [2019-09-08 04:23:46,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:46,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:47,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:47,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:23:47,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:23:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:23:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:23:47,058 INFO L87 Difference]: Start difference. First operand 624 states and 986 transitions. Second operand 4 states. [2019-09-08 04:23:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:47,115 INFO L93 Difference]: Finished difference Result 1203 states and 1923 transitions. [2019-09-08 04:23:47,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:23:47,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-08 04:23:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:47,123 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:23:47,123 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:23:47,127 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:23:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:23:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:23:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:23:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 963 transitions. [2019-09-08 04:23:47,149 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 963 transitions. Word has length 142 [2019-09-08 04:23:47,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:47,150 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 963 transitions. [2019-09-08 04:23:47,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:23:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 963 transitions. [2019-09-08 04:23:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:23:47,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:47,154 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:47,154 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1252309947, now seen corresponding path program 1 times [2019-09-08 04:23:47,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:47,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:47,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:23:47,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:23:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:23:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:23:47,292 INFO L87 Difference]: Start difference. First operand 611 states and 963 transitions. Second operand 6 states. [2019-09-08 04:23:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:47,546 INFO L93 Difference]: Finished difference Result 1143 states and 1815 transitions. [2019-09-08 04:23:47,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:23:47,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 04:23:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:47,552 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 04:23:47,552 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:23:47,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:23:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:23:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:23:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:23:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 959 transitions. [2019-09-08 04:23:47,578 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 959 transitions. Word has length 143 [2019-09-08 04:23:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:47,578 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 959 transitions. [2019-09-08 04:23:47,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:23:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 959 transitions. [2019-09-08 04:23:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:23:47,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:47,585 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:47,586 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -320376282, now seen corresponding path program 1 times [2019-09-08 04:23:47,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:47,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:47,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:23:47,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:23:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:23:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:23:47,764 INFO L87 Difference]: Start difference. First operand 611 states and 959 transitions. Second operand 6 states. [2019-09-08 04:23:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:47,992 INFO L93 Difference]: Finished difference Result 1143 states and 1811 transitions. [2019-09-08 04:23:47,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:23:47,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 04:23:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:47,997 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 04:23:48,001 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:23:48,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:23:48,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:23:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:23:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:23:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 955 transitions. [2019-09-08 04:23:48,029 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 955 transitions. Word has length 144 [2019-09-08 04:23:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:48,029 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 955 transitions. [2019-09-08 04:23:48,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:23:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 955 transitions. [2019-09-08 04:23:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:23:48,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:48,033 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:48,034 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 748593120, now seen corresponding path program 1 times [2019-09-08 04:23:48,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:48,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:48,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:48,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:23:48,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:23:48,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:23:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:23:48,160 INFO L87 Difference]: Start difference. First operand 611 states and 955 transitions. Second operand 6 states. [2019-09-08 04:23:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:48,347 INFO L93 Difference]: Finished difference Result 1143 states and 1807 transitions. [2019-09-08 04:23:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:23:48,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 04:23:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:48,352 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 04:23:48,353 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 04:23:48,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:23:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 04:23:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 04:23:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 04:23:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-09-08 04:23:48,377 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 145 [2019-09-08 04:23:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:48,377 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-09-08 04:23:48,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:23:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-09-08 04:23:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 04:23:48,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:48,382 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:48,382 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash 485194848, now seen corresponding path program 1 times [2019-09-08 04:23:48,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:48,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:48,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:48,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:48,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:23:48,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:23:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:23:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:23:48,561 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 7 states. [2019-09-08 04:23:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:48,662 INFO L93 Difference]: Finished difference Result 1143 states and 1803 transitions. [2019-09-08 04:23:48,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:23:48,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-09-08 04:23:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:48,670 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 04:23:48,670 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 04:23:48,676 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:23:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 04:23:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 04:23:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 04:23:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2019-09-08 04:23:48,707 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 145 [2019-09-08 04:23:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:48,708 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2019-09-08 04:23:48,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:23:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2019-09-08 04:23:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 04:23:48,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:48,715 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:48,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2104508459, now seen corresponding path program 1 times [2019-09-08 04:23:48,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:48,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:48,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:48,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:23:48,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:23:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:23:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:23:48,856 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand 6 states. [2019-09-08 04:23:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:48,960 INFO L93 Difference]: Finished difference Result 1122 states and 1769 transitions. [2019-09-08 04:23:48,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:23:48,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-08 04:23:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:48,965 INFO L225 Difference]: With dead ends: 1122 [2019-09-08 04:23:48,965 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 04:23:48,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:23:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 04:23:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 04:23:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 04:23:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 916 transitions. [2019-09-08 04:23:48,985 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 916 transitions. Word has length 146 [2019-09-08 04:23:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:48,986 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 916 transitions. [2019-09-08 04:23:48,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:23:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 916 transitions. [2019-09-08 04:23:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:23:48,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:48,993 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:23:48,993 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash -529154043, now seen corresponding path program 1 times [2019-09-08 04:23:48,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:48,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:48,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:48,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:48,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:49,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:23:49,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:23:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:23:49,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:23:49,166 INFO L87 Difference]: Start difference. First operand 590 states and 916 transitions. Second operand 6 states. [2019-09-08 04:23:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:49,294 INFO L93 Difference]: Finished difference Result 1122 states and 1768 transitions. [2019-09-08 04:23:49,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:23:49,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-08 04:23:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:49,302 INFO L225 Difference]: With dead ends: 1122 [2019-09-08 04:23:49,302 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 04:23:49,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:23:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 04:23:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 04:23:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 04:23:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-09-08 04:23:49,345 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 147 [2019-09-08 04:23:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:49,345 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-09-08 04:23:49,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:23:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-09-08 04:23:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 04:23:49,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:49,353 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 04:23:49,353 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2009289264, now seen corresponding path program 1 times [2019-09-08 04:23:49,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:49,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:49,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:49,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:49,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:23:49,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:23:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:23:49,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:23:49,711 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 12 states. [2019-09-08 04:23:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:49,956 INFO L93 Difference]: Finished difference Result 1123 states and 1767 transitions. [2019-09-08 04:23:49,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:23:49,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-09-08 04:23:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:49,966 INFO L225 Difference]: With dead ends: 1123 [2019-09-08 04:23:49,966 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 04:23:49,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:23:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 04:23:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 04:23:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 04:23:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 914 transitions. [2019-09-08 04:23:50,006 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 914 transitions. Word has length 148 [2019-09-08 04:23:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:50,006 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 914 transitions. [2019-09-08 04:23:50,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:23:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 914 transitions. [2019-09-08 04:23:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:23:50,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:50,012 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:50,013 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:50,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -650692984, now seen corresponding path program 1 times [2019-09-08 04:23:50,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:50,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:50,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:50,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:50,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:23:50,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:50,219 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:23:50,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:50,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:23:50,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:23:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 04:23:51,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:23:51,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 04:23:51,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:23:51,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:23:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:23:51,076 INFO L87 Difference]: Start difference. First operand 590 states and 914 transitions. Second operand 7 states. [2019-09-08 04:23:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:52,588 INFO L93 Difference]: Finished difference Result 1637 states and 2660 transitions. [2019-09-08 04:23:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:23:52,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-09-08 04:23:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:52,599 INFO L225 Difference]: With dead ends: 1637 [2019-09-08 04:23:52,599 INFO L226 Difference]: Without dead ends: 1113 [2019-09-08 04:23:52,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:23:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2019-09-08 04:23:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1111. [2019-09-08 04:23:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-09-08 04:23:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1761 transitions. [2019-09-08 04:23:52,660 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1761 transitions. Word has length 149 [2019-09-08 04:23:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:52,660 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1761 transitions. [2019-09-08 04:23:52,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:23:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1761 transitions. [2019-09-08 04:23:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 04:23:52,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:52,665 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:52,665 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1884922170, now seen corresponding path program 1 times [2019-09-08 04:23:52,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:52,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:23:52,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:52,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:23:52,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:53,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:23:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:23:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:23:53,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:23:53,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 04:23:53,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:23:53,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:23:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:23:53,306 INFO L87 Difference]: Start difference. First operand 1111 states and 1761 transitions. Second operand 7 states. [2019-09-08 04:23:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:54,662 INFO L93 Difference]: Finished difference Result 3214 states and 5283 transitions. [2019-09-08 04:23:54,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:23:54,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-09-08 04:23:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:54,682 INFO L225 Difference]: With dead ends: 3214 [2019-09-08 04:23:54,682 INFO L226 Difference]: Without dead ends: 2169 [2019-09-08 04:23:54,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:23:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-08 04:23:54,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2166. [2019-09-08 04:23:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2166 states. [2019-09-08 04:23:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 2166 states and 3485 transitions. [2019-09-08 04:23:54,784 INFO L78 Accepts]: Start accepts. Automaton has 2166 states and 3485 transitions. Word has length 152 [2019-09-08 04:23:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:54,785 INFO L475 AbstractCegarLoop]: Abstraction has 2166 states and 3485 transitions. [2019-09-08 04:23:54,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:23:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 3485 transitions. [2019-09-08 04:23:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:23:54,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:54,790 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:54,790 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2042213898, now seen corresponding path program 1 times [2019-09-08 04:23:54,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:54,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:54,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:23:54,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:54,918 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:23:54,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:55,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 2799 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:23:55,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:23:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 04:23:55,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:23:55,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 04:23:55,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:23:55,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:23:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:23:55,428 INFO L87 Difference]: Start difference. First operand 2166 states and 3485 transitions. Second operand 7 states. [2019-09-08 04:23:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:56,665 INFO L93 Difference]: Finished difference Result 6409 states and 10642 transitions. [2019-09-08 04:23:56,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:23:56,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-08 04:23:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:56,703 INFO L225 Difference]: With dead ends: 6409 [2019-09-08 04:23:56,704 INFO L226 Difference]: Without dead ends: 4309 [2019-09-08 04:23:56,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:23:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-09-08 04:23:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 4305. [2019-09-08 04:23:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2019-09-08 04:23:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 7011 transitions. [2019-09-08 04:23:56,902 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 7011 transitions. Word has length 155 [2019-09-08 04:23:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:56,902 INFO L475 AbstractCegarLoop]: Abstraction has 4305 states and 7011 transitions. [2019-09-08 04:23:56,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:23:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 7011 transitions. [2019-09-08 04:23:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:23:56,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:56,907 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:23:56,907 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash -60670832, now seen corresponding path program 1 times [2019-09-08 04:23:56,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:56,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 04:23:57,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:57,047 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:23:57,069 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:23:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:57,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 2803 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:23:57,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:23:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 04:23:57,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:23:57,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 04:23:57,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:23:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:23:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:23:57,546 INFO L87 Difference]: Start difference. First operand 4305 states and 7011 transitions. Second operand 7 states. [2019-09-08 04:23:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:59,006 INFO L93 Difference]: Finished difference Result 12892 states and 21697 transitions. [2019-09-08 04:23:59,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:23:59,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-09-08 04:23:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:59,094 INFO L225 Difference]: With dead ends: 12892 [2019-09-08 04:23:59,094 INFO L226 Difference]: Without dead ends: 8653 [2019-09-08 04:23:59,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:23:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8653 states. [2019-09-08 04:23:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8653 to 8648. [2019-09-08 04:23:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8648 states. [2019-09-08 04:23:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8648 states to 8648 states and 14285 transitions. [2019-09-08 04:23:59,584 INFO L78 Accepts]: Start accepts. Automaton has 8648 states and 14285 transitions. Word has length 158 [2019-09-08 04:23:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:59,588 INFO L475 AbstractCegarLoop]: Abstraction has 8648 states and 14285 transitions. [2019-09-08 04:23:59,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:23:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8648 states and 14285 transitions. [2019-09-08 04:23:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:23:59,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:59,595 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:59,596 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash 383413132, now seen corresponding path program 1 times [2019-09-08 04:23:59,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 04:23:59,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:23:59,920 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:23:59,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:00,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:24:00,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:24:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 04:24:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:24:00,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 04:24:00,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:24:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:24:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:24:00,500 INFO L87 Difference]: Start difference. First operand 8648 states and 14285 transitions. Second operand 12 states. [2019-09-08 04:24:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:16,073 INFO L93 Difference]: Finished difference Result 45543 states and 81801 transitions. [2019-09-08 04:24:16,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 04:24:16,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-09-08 04:24:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:17,337 INFO L225 Difference]: With dead ends: 45543 [2019-09-08 04:24:17,338 INFO L226 Difference]: Without dead ends: 36937 [2019-09-08 04:24:17,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:24:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36937 states. [2019-09-08 04:24:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36937 to 36420. [2019-09-08 04:24:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36420 states. [2019-09-08 04:24:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36420 states to 36420 states and 64939 transitions. [2019-09-08 04:24:19,398 INFO L78 Accepts]: Start accepts. Automaton has 36420 states and 64939 transitions. Word has length 161 [2019-09-08 04:24:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:19,398 INFO L475 AbstractCegarLoop]: Abstraction has 36420 states and 64939 transitions. [2019-09-08 04:24:19,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:24:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 36420 states and 64939 transitions. [2019-09-08 04:24:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 04:24:19,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:19,467 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-09-08 04:24:19,467 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1031668665, now seen corresponding path program 1 times [2019-09-08 04:24:19,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:19,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:19,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 04:24:19,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:24:19,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:24:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:24:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:24:19,707 INFO L87 Difference]: Start difference. First operand 36420 states and 64939 transitions. Second operand 9 states. [2019-09-08 04:24:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:24,325 INFO L93 Difference]: Finished difference Result 73085 states and 134598 transitions. [2019-09-08 04:24:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:24:24,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 244 [2019-09-08 04:24:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:24,657 INFO L225 Difference]: With dead ends: 73085 [2019-09-08 04:24:24,657 INFO L226 Difference]: Without dead ends: 36740 [2019-09-08 04:24:24,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:24:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36740 states. [2019-09-08 04:24:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36740 to 36612. [2019-09-08 04:24:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36612 states. [2019-09-08 04:24:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36612 states to 36612 states and 65259 transitions. [2019-09-08 04:24:28,093 INFO L78 Accepts]: Start accepts. Automaton has 36612 states and 65259 transitions. Word has length 244 [2019-09-08 04:24:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:28,094 INFO L475 AbstractCegarLoop]: Abstraction has 36612 states and 65259 transitions. [2019-09-08 04:24:28,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:24:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36612 states and 65259 transitions. [2019-09-08 04:24:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:24:28,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:28,182 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-09-08 04:24:28,182 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2108748300, now seen corresponding path program 1 times [2019-09-08 04:24:28,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:28,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 04:24:28,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:24:28,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:24:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:24:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:24:28,363 INFO L87 Difference]: Start difference. First operand 36612 states and 65259 transitions. Second operand 9 states. [2019-09-08 04:24:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:29,470 INFO L93 Difference]: Finished difference Result 53736 states and 94411 transitions. [2019-09-08 04:24:29,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:24:29,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 245 [2019-09-08 04:24:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:29,569 INFO L225 Difference]: With dead ends: 53736 [2019-09-08 04:24:29,570 INFO L226 Difference]: Without dead ends: 17178 [2019-09-08 04:24:29,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:24:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17178 states. [2019-09-08 04:24:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17178 to 17178. [2019-09-08 04:24:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17178 states. [2019-09-08 04:24:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17178 states to 17178 states and 29207 transitions. [2019-09-08 04:24:30,392 INFO L78 Accepts]: Start accepts. Automaton has 17178 states and 29207 transitions. Word has length 245 [2019-09-08 04:24:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:30,392 INFO L475 AbstractCegarLoop]: Abstraction has 17178 states and 29207 transitions. [2019-09-08 04:24:30,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:24:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 17178 states and 29207 transitions. [2019-09-08 04:24:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-09-08 04:24:30,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:30,418 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,418 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1969383594, now seen corresponding path program 1 times [2019-09-08 04:24:30,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:30,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:30,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-08 04:24:30,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:24:30,720 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:30,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:31,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 4104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 04:24:31,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:24:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-08 04:24:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:24:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-08 04:24:33,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:24:33,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:24:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:24:33,234 INFO L87 Difference]: Start difference. First operand 17178 states and 29207 transitions. Second operand 13 states. [2019-09-08 04:24:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:59,898 INFO L93 Difference]: Finished difference Result 129454 states and 278575 transitions. [2019-09-08 04:24:59,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 04:24:59,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 363 [2019-09-08 04:24:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:01,189 INFO L225 Difference]: With dead ends: 129454 [2019-09-08 04:25:01,189 INFO L226 Difference]: Without dead ends: 112339 [2019-09-08 04:25:01,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=562, Invalid=2744, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 04:25:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112339 states. [2019-09-08 04:25:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112339 to 105237. [2019-09-08 04:25:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105237 states. [2019-09-08 04:25:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105237 states to 105237 states and 195935 transitions. [2019-09-08 04:25:11,063 INFO L78 Accepts]: Start accepts. Automaton has 105237 states and 195935 transitions. Word has length 363 [2019-09-08 04:25:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:11,064 INFO L475 AbstractCegarLoop]: Abstraction has 105237 states and 195935 transitions. [2019-09-08 04:25:11,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:25:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 105237 states and 195935 transitions. [2019-09-08 04:25:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 04:25:11,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:11,091 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-09-08 04:25:11,092 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:11,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1360204451, now seen corresponding path program 1 times [2019-09-08 04:25:11,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:11,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:11,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:11,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:11,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 04:25:11,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:11,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:25:11,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:25:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:25:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:25:11,297 INFO L87 Difference]: Start difference. First operand 105237 states and 195935 transitions. Second operand 9 states. [2019-09-08 04:25:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:31,339 INFO L93 Difference]: Finished difference Result 357118 states and 886467 transitions. [2019-09-08 04:25:31,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:25:31,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 251 [2019-09-08 04:25:31,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:39,996 INFO L225 Difference]: With dead ends: 357118 [2019-09-08 04:25:39,996 INFO L226 Difference]: Without dead ends: 251944 [2019-09-08 04:25:40,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:25:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251944 states. [2019-09-08 04:25:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251944 to 233135. [2019-09-08 04:25:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233135 states. [2019-09-08 04:25:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233135 states to 233135 states and 488231 transitions. [2019-09-08 04:25:59,414 INFO L78 Accepts]: Start accepts. Automaton has 233135 states and 488231 transitions. Word has length 251 [2019-09-08 04:25:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:59,415 INFO L475 AbstractCegarLoop]: Abstraction has 233135 states and 488231 transitions. [2019-09-08 04:25:59,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:25:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 233135 states and 488231 transitions. [2019-09-08 04:25:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 04:25:59,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:59,460 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-09-08 04:25:59,460 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1054569922, now seen corresponding path program 1 times [2019-09-08 04:25:59,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:59,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:59,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:59,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:59,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 04:25:59,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:59,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:25:59,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:25:59,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:25:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:25:59,651 INFO L87 Difference]: Start difference. First operand 233135 states and 488231 transitions. Second operand 7 states. [2019-09-08 04:26:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:18,844 INFO L93 Difference]: Finished difference Result 468906 states and 1045400 transitions. [2019-09-08 04:26:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:26:18,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 251 [2019-09-08 04:26:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:22,990 INFO L225 Difference]: With dead ends: 468906 [2019-09-08 04:26:22,990 INFO L226 Difference]: Without dead ends: 235835 [2019-09-08 04:26:23,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:26:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235835 states. [2019-09-08 04:26:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235835 to 235823. [2019-09-08 04:26:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235823 states. [2019-09-08 04:26:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235823 states to 235823 states and 491175 transitions. [2019-09-08 04:26:52,395 INFO L78 Accepts]: Start accepts. Automaton has 235823 states and 491175 transitions. Word has length 251 [2019-09-08 04:26:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:52,396 INFO L475 AbstractCegarLoop]: Abstraction has 235823 states and 491175 transitions. [2019-09-08 04:26:52,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:26:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 235823 states and 491175 transitions. [2019-09-08 04:26:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 04:26:52,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:52,451 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-09-08 04:26:52,451 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -8873018, now seen corresponding path program 1 times [2019-09-08 04:26:52,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 04:26:52,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:26:52,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:26:52,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:26:52,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:26:52,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:26:52,650 INFO L87 Difference]: Start difference. First operand 235823 states and 491175 transitions. Second operand 8 states. [2019-09-08 04:27:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:29,928 INFO L93 Difference]: Finished difference Result 558281 states and 1242551 transitions. [2019-09-08 04:27:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:27:29,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2019-09-08 04:27:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:33,253 INFO L225 Difference]: With dead ends: 558281 [2019-09-08 04:27:33,253 INFO L226 Difference]: Without dead ends: 322259 [2019-09-08 04:27:34,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:27:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322259 states. [2019-09-08 04:28:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322259 to 321268. [2019-09-08 04:28:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321268 states. [2019-09-08 04:28:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321268 states to 321268 states and 718413 transitions. [2019-09-08 04:28:12,014 INFO L78 Accepts]: Start accepts. Automaton has 321268 states and 718413 transitions. Word has length 252 [2019-09-08 04:28:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:28:12,015 INFO L475 AbstractCegarLoop]: Abstraction has 321268 states and 718413 transitions. [2019-09-08 04:28:12,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:28:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 321268 states and 718413 transitions. [2019-09-08 04:28:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-08 04:28:12,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:28:12,066 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:12,066 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:28:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:28:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1098955753, now seen corresponding path program 1 times [2019-09-08 04:28:12,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:28:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:28:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:12,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:28:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:28:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-08 04:28:12,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:28:12,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:28:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:28:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:28:12,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 4126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 04:28:12,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:28:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-08 04:28:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:28:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 04:28:13,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:28:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:28:13,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:28:13,155 INFO L87 Difference]: Start difference. First operand 321268 states and 718413 transitions. Second operand 10 states.