/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:42:24,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:42:24,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:42:24,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:42:24,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:42:24,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:42:24,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:42:24,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:42:24,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:42:24,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:42:24,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:42:24,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:42:24,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:42:24,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:42:24,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:42:24,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:42:24,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:42:24,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:42:24,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:42:24,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:42:24,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:42:24,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:42:24,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:42:24,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:42:24,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:42:24,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:42:24,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:42:24,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:42:24,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:42:24,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:42:24,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:42:24,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:42:24,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:42:24,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:42:24,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:42:24,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:42:24,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:42:24,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:42:24,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:42:24,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:42:24,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:42:24,868 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-11-07 00:42:24,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:42:24,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:42:24,890 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:42:24,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:42:24,891 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:42:24,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:42:24,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:42:24,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:42:24,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:42:24,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:42:24,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:42:24,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:42:24,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:42:24,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:42:24,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:42:24,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:42:24,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:42:24,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:42:24,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:42:24,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:42:24,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:42:24,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:42:24,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:42:24,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:42:24,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:42:24,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:42:24,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:42:24,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:42:24,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:42:25,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:42:25,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:42:25,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:42:25,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:42:25,190 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:42:25,191 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-11-07 00:42:25,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78e795d4/5b639b76f1a546b18d2e3d81806d1261/FLAG754bc9f9d [2019-11-07 00:42:25,852 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:42:25,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-11-07 00:42:25,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78e795d4/5b639b76f1a546b18d2e3d81806d1261/FLAG754bc9f9d [2019-11-07 00:42:26,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78e795d4/5b639b76f1a546b18d2e3d81806d1261 [2019-11-07 00:42:26,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:42:26,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:42:26,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:26,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:42:26,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:42:26,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:26" (1/1) ... [2019-11-07 00:42:26,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3189ba63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:26, skipping insertion in model container [2019-11-07 00:42:26,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:26" (1/1) ... [2019-11-07 00:42:26,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:42:26,229 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:42:26,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:26,961 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:42:27,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:27,196 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:42:27,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27 WrapperNode [2019-11-07 00:42:27,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:27,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:42:27,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:42:27,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:42:27,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (1/1) ... [2019-11-07 00:42:27,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:42:27,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:42:27,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:42:27,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:42:27,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (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-11-07 00:42:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:42:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:42:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-11-07 00:42:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-11-07 00:42:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-11-07 00:42:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-11-07 00:42:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-11-07 00:42:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-11-07 00:42:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-11-07 00:42:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-11-07 00:42:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-11-07 00:42:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-11-07 00:42:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-11-07 00:42:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-11-07 00:42:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-11-07 00:42:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-11-07 00:42:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-11-07 00:42:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-11-07 00:42:27,473 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-11-07 00:42:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-11-07 00:42:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-11-07 00:42:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-11-07 00:42:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-11-07 00:42:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-11-07 00:42:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-11-07 00:42:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-11-07 00:42:27,476 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:27,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-11-07 00:42:27,476 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-11-07 00:42:27,476 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-11-07 00:42:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-11-07 00:42:27,478 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-11-07 00:42:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-11-07 00:42:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-11-07 00:42:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-11-07 00:42:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-11-07 00:42:27,480 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-11-07 00:42:27,481 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-11-07 00:42:27,481 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-11-07 00:42:27,481 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-11-07 00:42:27,482 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-11-07 00:42:27,482 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-11-07 00:42:27,482 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-11-07 00:42:27,483 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-11-07 00:42:27,484 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-11-07 00:42:27,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-11-07 00:42:27,484 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-11-07 00:42:27,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:42:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:42:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:42:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-11-07 00:42:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-11-07 00:42:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-11-07 00:42:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-11-07 00:42:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-11-07 00:42:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-11-07 00:42:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-11-07 00:42:27,488 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-11-07 00:42:27,489 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-11-07 00:42:27,489 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-11-07 00:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:27,490 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 00:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-11-07 00:42:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-11-07 00:42:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-11-07 00:42:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-11-07 00:42:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-11-07 00:42:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-11-07 00:42:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-11-07 00:42:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-11-07 00:42:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-11-07 00:42:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-11-07 00:42:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-11-07 00:42:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-11-07 00:42:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-11-07 00:42:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-11-07 00:42:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-11-07 00:42:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-11-07 00:42:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-11-07 00:42:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-11-07 00:42:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-11-07 00:42:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-11-07 00:42:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-11-07 00:42:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-11-07 00:42:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-11-07 00:42:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-11-07 00:42:27,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-11-07 00:42:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-11-07 00:42:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-11-07 00:42:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:42:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:42:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:42:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:42:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:42:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:42:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:27,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:42:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:42:27,507 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-11-07 00:42:27,515 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-11-07 00:42:27,516 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-11-07 00:42:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-11-07 00:42:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-11-07 00:42:27,517 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-11-07 00:42:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-11-07 00:42:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-11-07 00:42:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-11-07 00:42:27,518 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-11-07 00:42:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-11-07 00:42:27,519 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-11-07 00:42:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-11-07 00:42:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:42:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:42:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-07 00:42:27,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:42:29,853 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:42:29,854 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-07 00:42:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:29 BoogieIcfgContainer [2019-11-07 00:42:29,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:42:29,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:42:29,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:42:29,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:42:29,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:26" (1/3) ... [2019-11-07 00:42:29,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5700a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:29, skipping insertion in model container [2019-11-07 00:42:29,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:27" (2/3) ... [2019-11-07 00:42:29,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5700a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:29, skipping insertion in model container [2019-11-07 00:42:29,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:29" (3/3) ... [2019-11-07 00:42:29,868 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2019-11-07 00:42:29,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:42:29,893 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:42:29,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:42:29,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:42:29,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:42:29,951 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:42:29,951 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:42:29,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:42:29,951 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:42:29,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:42:29,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:42:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-11-07 00:42:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-07 00:42:30,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:30,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:30,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:30,040 INFO L82 PathProgramCache]: Analyzing trace with hash -517241816, now seen corresponding path program 1 times [2019-11-07 00:42:30,050 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:30,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805735890] [2019-11-07 00:42:30,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:30,679 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805735890] [2019-11-07 00:42:30,680 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:30,680 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:30,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191803827] [2019-11-07 00:42:30,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:30,690 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:30,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:30,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:30,709 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-11-07 00:42:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:30,938 INFO L93 Difference]: Finished difference Result 1179 states and 1917 transitions. [2019-11-07 00:42:30,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:30,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-07 00:42:30,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:30,977 INFO L225 Difference]: With dead ends: 1179 [2019-11-07 00:42:30,977 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 00:42:30,988 INFO L630 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-11-07 00:42:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 00:42:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 00:42:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 00:42:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 960 transitions. [2019-11-07 00:42:31,103 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 960 transitions. Word has length 107 [2019-11-07 00:42:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:31,106 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 960 transitions. [2019-11-07 00:42:31,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 960 transitions. [2019-11-07 00:42:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-07 00:42:31,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:31,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:31,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1593007226, now seen corresponding path program 1 times [2019-11-07 00:42:31,115 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:31,115 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086965897] [2019-11-07 00:42:31,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:31,319 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086965897] [2019-11-07 00:42:31,319 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:31,319 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:31,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513561371] [2019-11-07 00:42:31,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:31,329 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:31,330 INFO L87 Difference]: Start difference. First operand 598 states and 960 transitions. Second operand 4 states. [2019-11-07 00:42:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:31,414 INFO L93 Difference]: Finished difference Result 1159 states and 1878 transitions. [2019-11-07 00:42:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:31,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-07 00:42:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:31,421 INFO L225 Difference]: With dead ends: 1159 [2019-11-07 00:42:31,422 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 00:42:31,426 INFO L630 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-11-07 00:42:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 00:42:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 00:42:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 00:42:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-11-07 00:42:31,468 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 110 [2019-11-07 00:42:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:31,468 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-11-07 00:42:31,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-11-07 00:42:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-07 00:42:31,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:31,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:31,475 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2107821335, now seen corresponding path program 1 times [2019-11-07 00:42:31,475 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:31,476 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765895619] [2019-11-07 00:42:31,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:31,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765895619] [2019-11-07 00:42:31,742 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:31,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:31,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426344705] [2019-11-07 00:42:31,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:31,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:31,745 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 4 states. [2019-11-07 00:42:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:31,819 INFO L93 Difference]: Finished difference Result 1159 states and 1877 transitions. [2019-11-07 00:42:31,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:31,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-07 00:42:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:31,825 INFO L225 Difference]: With dead ends: 1159 [2019-11-07 00:42:31,826 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 00:42:31,829 INFO L630 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-11-07 00:42:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 00:42:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 00:42:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 00:42:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-11-07 00:42:31,858 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 111 [2019-11-07 00:42:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:31,859 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-11-07 00:42:31,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-11-07 00:42:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-07 00:42:31,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:31,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:31,864 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1729710442, now seen corresponding path program 1 times [2019-11-07 00:42:31,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:31,865 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334178414] [2019-11-07 00:42:31,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:32,021 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334178414] [2019-11-07 00:42:32,021 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:32,022 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:32,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008657662] [2019-11-07 00:42:32,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:32,024 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:32,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:32,025 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-11-07 00:42:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:32,094 INFO L93 Difference]: Finished difference Result 1159 states and 1876 transitions. [2019-11-07 00:42:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:32,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-07 00:42:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:32,101 INFO L225 Difference]: With dead ends: 1159 [2019-11-07 00:42:32,101 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 00:42:32,105 INFO L630 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-11-07 00:42:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 00:42:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 00:42:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 00:42:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-11-07 00:42:32,137 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 112 [2019-11-07 00:42:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:32,138 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-11-07 00:42:32,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-11-07 00:42:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-07 00:42:32,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:32,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:32,144 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:32,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1243956083, now seen corresponding path program 1 times [2019-11-07 00:42:32,144 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:32,145 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656493037] [2019-11-07 00:42:32,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:32,291 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656493037] [2019-11-07 00:42:32,292 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:32,292 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:32,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183044110] [2019-11-07 00:42:32,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:32,293 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:32,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:32,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:32,294 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-11-07 00:42:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:32,358 INFO L93 Difference]: Finished difference Result 1159 states and 1875 transitions. [2019-11-07 00:42:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:32,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-07 00:42:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:32,365 INFO L225 Difference]: With dead ends: 1159 [2019-11-07 00:42:32,365 INFO L226 Difference]: Without dead ends: 598 [2019-11-07 00:42:32,369 INFO L630 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-11-07 00:42:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-07 00:42:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-07 00:42:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-07 00:42:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-11-07 00:42:32,399 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 113 [2019-11-07 00:42:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:32,400 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-11-07 00:42:32,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-11-07 00:42:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 00:42:32,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:32,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:32,405 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 616405170, now seen corresponding path program 1 times [2019-11-07 00:42:32,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:32,406 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039169370] [2019-11-07 00:42:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:32,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039169370] [2019-11-07 00:42:32,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:32,647 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:42:32,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772940522] [2019-11-07 00:42:32,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:42:32,649 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:42:32,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:42:32,655 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 10 states. [2019-11-07 00:42:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:32,832 INFO L93 Difference]: Finished difference Result 1117 states and 1795 transitions. [2019-11-07 00:42:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:42:32,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-11-07 00:42:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:32,842 INFO L225 Difference]: With dead ends: 1117 [2019-11-07 00:42:32,842 INFO L226 Difference]: Without dead ends: 607 [2019-11-07 00:42:32,847 INFO L630 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-11-07 00:42:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-07 00:42:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2019-11-07 00:42:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-07 00:42:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-11-07 00:42:32,885 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 114 [2019-11-07 00:42:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:32,888 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-11-07 00:42:32,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:42:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-11-07 00:42:32,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-07 00:42:32,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:32,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:32,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1035922001, now seen corresponding path program 1 times [2019-11-07 00:42:32,900 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:32,900 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270093338] [2019-11-07 00:42:32,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:33,035 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270093338] [2019-11-07 00:42:33,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:33,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:33,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827399192] [2019-11-07 00:42:33,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:33,037 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:33,038 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-11-07 00:42:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:33,104 INFO L93 Difference]: Finished difference Result 1165 states and 1881 transitions. [2019-11-07 00:42:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:33,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-07 00:42:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:33,113 INFO L225 Difference]: With dead ends: 1165 [2019-11-07 00:42:33,113 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:33,117 INFO L630 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-11-07 00:42:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 942 transitions. [2019-11-07 00:42:33,140 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 942 transitions. Word has length 114 [2019-11-07 00:42:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:33,141 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 942 transitions. [2019-11-07 00:42:33,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 942 transitions. [2019-11-07 00:42:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-07 00:42:33,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:33,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:33,145 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:33,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1806095573, now seen corresponding path program 1 times [2019-11-07 00:42:33,146 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:33,146 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135822167] [2019-11-07 00:42:33,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:33,354 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135822167] [2019-11-07 00:42:33,355 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:33,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:33,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097121250] [2019-11-07 00:42:33,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:33,356 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:33,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:33,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:33,357 INFO L87 Difference]: Start difference. First operand 592 states and 942 transitions. Second operand 6 states. [2019-11-07 00:42:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:33,594 INFO L93 Difference]: Finished difference Result 1105 states and 1773 transitions. [2019-11-07 00:42:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:33,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-11-07 00:42:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:33,602 INFO L225 Difference]: With dead ends: 1105 [2019-11-07 00:42:33,602 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:33,607 INFO L630 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-11-07 00:42:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 938 transitions. [2019-11-07 00:42:33,639 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 938 transitions. Word has length 115 [2019-11-07 00:42:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:33,639 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 938 transitions. [2019-11-07 00:42:33,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 938 transitions. [2019-11-07 00:42:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-07 00:42:33,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:33,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:33,646 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash 36368181, now seen corresponding path program 1 times [2019-11-07 00:42:33,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:33,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267951744] [2019-11-07 00:42:33,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:33,811 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267951744] [2019-11-07 00:42:33,812 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:33,812 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:33,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263925723] [2019-11-07 00:42:33,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:33,813 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:33,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:33,814 INFO L87 Difference]: Start difference. First operand 592 states and 938 transitions. Second operand 6 states. [2019-11-07 00:42:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:34,082 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-11-07 00:42:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:34,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-11-07 00:42:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:34,090 INFO L225 Difference]: With dead ends: 1105 [2019-11-07 00:42:34,090 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:34,095 INFO L630 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-11-07 00:42:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 934 transitions. [2019-11-07 00:42:34,122 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 934 transitions. Word has length 116 [2019-11-07 00:42:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:34,123 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 934 transitions. [2019-11-07 00:42:34,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 934 transitions. [2019-11-07 00:42:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 00:42:34,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:34,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:34,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1408982758, now seen corresponding path program 1 times [2019-11-07 00:42:34,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:34,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135572733] [2019-11-07 00:42:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:34,298 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135572733] [2019-11-07 00:42:34,299 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:34,299 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:34,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447038045] [2019-11-07 00:42:34,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:34,300 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:34,301 INFO L87 Difference]: Start difference. First operand 592 states and 934 transitions. Second operand 6 states. [2019-11-07 00:42:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:34,602 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-11-07 00:42:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:34,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-11-07 00:42:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:34,609 INFO L225 Difference]: With dead ends: 1105 [2019-11-07 00:42:34,609 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:34,617 INFO L630 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-11-07 00:42:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 930 transitions. [2019-11-07 00:42:34,645 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 930 transitions. Word has length 117 [2019-11-07 00:42:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:34,645 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 930 transitions. [2019-11-07 00:42:34,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 930 transitions. [2019-11-07 00:42:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-07 00:42:34,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:34,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:34,649 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -954122854, now seen corresponding path program 1 times [2019-11-07 00:42:34,650 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:34,650 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116746698] [2019-11-07 00:42:34,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:34,792 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116746698] [2019-11-07 00:42:34,792 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:34,792 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:42:34,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687854088] [2019-11-07 00:42:34,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:42:34,793 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:42:34,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:42:34,794 INFO L87 Difference]: Start difference. First operand 592 states and 930 transitions. Second operand 7 states. [2019-11-07 00:42:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:34,882 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-11-07 00:42:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:42:34,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-11-07 00:42:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:34,887 INFO L225 Difference]: With dead ends: 1105 [2019-11-07 00:42:34,888 INFO L226 Difference]: Without dead ends: 571 [2019-11-07 00:42:34,891 INFO L630 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-11-07 00:42:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-07 00:42:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-07 00:42:34,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 00:42:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 896 transitions. [2019-11-07 00:42:34,912 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 896 transitions. Word has length 117 [2019-11-07 00:42:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:34,913 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 896 transitions. [2019-11-07 00:42:34,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:42:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 896 transitions. [2019-11-07 00:42:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-07 00:42:34,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:34,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:34,917 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598246, now seen corresponding path program 1 times [2019-11-07 00:42:34,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:34,918 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834316354] [2019-11-07 00:42:34,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:35,043 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834316354] [2019-11-07 00:42:35,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:35,044 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:35,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027150494] [2019-11-07 00:42:35,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:35,045 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:35,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:35,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:35,045 INFO L87 Difference]: Start difference. First operand 571 states and 896 transitions. Second operand 6 states. [2019-11-07 00:42:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:35,157 INFO L93 Difference]: Finished difference Result 1084 states and 1727 transitions. [2019-11-07 00:42:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:35,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-11-07 00:42:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:35,165 INFO L225 Difference]: With dead ends: 1084 [2019-11-07 00:42:35,165 INFO L226 Difference]: Without dead ends: 571 [2019-11-07 00:42:35,170 INFO L630 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-11-07 00:42:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-07 00:42:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-07 00:42:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 00:42:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 895 transitions. [2019-11-07 00:42:35,200 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 895 transitions. Word has length 118 [2019-11-07 00:42:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:35,201 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 895 transitions. [2019-11-07 00:42:35,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 895 transitions. [2019-11-07 00:42:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-07 00:42:35,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:35,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:35,207 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1119912287, now seen corresponding path program 1 times [2019-11-07 00:42:35,208 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:35,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041309736] [2019-11-07 00:42:35,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:35,458 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041309736] [2019-11-07 00:42:35,458 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:35,458 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:35,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865381944] [2019-11-07 00:42:35,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:35,460 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:35,461 INFO L87 Difference]: Start difference. First operand 571 states and 895 transitions. Second operand 6 states. [2019-11-07 00:42:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:35,595 INFO L93 Difference]: Finished difference Result 1084 states and 1726 transitions. [2019-11-07 00:42:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:35,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-11-07 00:42:35,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:35,603 INFO L225 Difference]: With dead ends: 1084 [2019-11-07 00:42:35,603 INFO L226 Difference]: Without dead ends: 571 [2019-11-07 00:42:35,607 INFO L630 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-11-07 00:42:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-07 00:42:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-07 00:42:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 00:42:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-11-07 00:42:35,629 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 119 [2019-11-07 00:42:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:35,630 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-11-07 00:42:35,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-11-07 00:42:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 00:42:35,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:35,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:35,635 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash -844049153, now seen corresponding path program 1 times [2019-11-07 00:42:35,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:35,636 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19722028] [2019-11-07 00:42:35,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:35,842 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19722028] [2019-11-07 00:42:35,843 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:35,843 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:42:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880860944] [2019-11-07 00:42:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:42:35,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:42:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:42:35,846 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 12 states. [2019-11-07 00:42:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:36,068 INFO L93 Difference]: Finished difference Result 1085 states and 1725 transitions. [2019-11-07 00:42:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:42:36,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-11-07 00:42:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:36,075 INFO L225 Difference]: With dead ends: 1085 [2019-11-07 00:42:36,076 INFO L226 Difference]: Without dead ends: 571 [2019-11-07 00:42:36,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:42:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-07 00:42:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-07 00:42:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-07 00:42:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-11-07 00:42:36,106 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 120 [2019-11-07 00:42:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:36,109 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-11-07 00:42:36,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:42:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-11-07 00:42:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-07 00:42:36,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:36,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:36,116 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 704955672, now seen corresponding path program 1 times [2019-11-07 00:42:36,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:36,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959414596] [2019-11-07 00:42:36,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:36,378 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959414596] [2019-11-07 00:42:36,378 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:36,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:42:36,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59881379] [2019-11-07 00:42:36,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:42:36,380 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:36,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:42:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:42:36,381 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 9 states. [2019-11-07 00:42:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:40,359 INFO L93 Difference]: Finished difference Result 1082 states and 1739 transitions. [2019-11-07 00:42:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:42:40,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-11-07 00:42:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:40,365 INFO L225 Difference]: With dead ends: 1082 [2019-11-07 00:42:40,365 INFO L226 Difference]: Without dead ends: 577 [2019-11-07 00:42:40,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:42:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-07 00:42:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-11-07 00:42:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-07 00:42:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 912 transitions. [2019-11-07 00:42:40,396 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 912 transitions. Word has length 121 [2019-11-07 00:42:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:40,397 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 912 transitions. [2019-11-07 00:42:40,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:42:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 912 transitions. [2019-11-07 00:42:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 00:42:40,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:40,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:40,401 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 949783563, now seen corresponding path program 1 times [2019-11-07 00:42:40,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:40,402 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015472956] [2019-11-07 00:42:40,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:40,565 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015472956] [2019-11-07 00:42:40,565 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:40,565 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:42:40,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083259018] [2019-11-07 00:42:40,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:42:40,566 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:40,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:42:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:42:40,567 INFO L87 Difference]: Start difference. First operand 575 states and 912 transitions. Second operand 8 states. [2019-11-07 00:42:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:46,991 INFO L93 Difference]: Finished difference Result 2026 states and 3340 transitions. [2019-11-07 00:42:46,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 00:42:46,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-11-07 00:42:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:47,010 INFO L225 Difference]: With dead ends: 2026 [2019-11-07 00:42:47,010 INFO L226 Difference]: Without dead ends: 1517 [2019-11-07 00:42:47,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:42:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-11-07 00:42:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1478. [2019-11-07 00:42:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2019-11-07 00:42:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2365 transitions. [2019-11-07 00:42:47,109 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2365 transitions. Word has length 122 [2019-11-07 00:42:47,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:47,109 INFO L462 AbstractCegarLoop]: Abstraction has 1478 states and 2365 transitions. [2019-11-07 00:42:47,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:42:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2365 transitions. [2019-11-07 00:42:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 00:42:47,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:47,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:47,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 360253614, now seen corresponding path program 1 times [2019-11-07 00:42:47,115 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:47,115 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569550956] [2019-11-07 00:42:47,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:47,379 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569550956] [2019-11-07 00:42:47,379 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:47,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 00:42:47,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639333767] [2019-11-07 00:42:47,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:42:47,380 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:47,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:42:47,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:42:47,381 INFO L87 Difference]: Start difference. First operand 1478 states and 2365 transitions. Second operand 9 states. [2019-11-07 00:42:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:54,786 INFO L93 Difference]: Finished difference Result 4735 states and 7800 transitions. [2019-11-07 00:42:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:42:54,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-11-07 00:42:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:54,814 INFO L225 Difference]: With dead ends: 4735 [2019-11-07 00:42:54,814 INFO L226 Difference]: Without dead ends: 3323 [2019-11-07 00:42:54,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:42:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-11-07 00:42:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3100. [2019-11-07 00:42:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-11-07 00:42:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 5020 transitions. [2019-11-07 00:42:55,025 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 5020 transitions. Word has length 128 [2019-11-07 00:42:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:55,025 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 5020 transitions. [2019-11-07 00:42:55,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:42:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 5020 transitions. [2019-11-07 00:42:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-07 00:42:55,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:55,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:55,029 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 352494255, now seen corresponding path program 1 times [2019-11-07 00:42:55,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:55,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240403780] [2019-11-07 00:42:55,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:55,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240403780] [2019-11-07 00:42:55,197 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:55,197 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:42:55,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168313583] [2019-11-07 00:42:55,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:42:55,198 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:42:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:42:55,199 INFO L87 Difference]: Start difference. First operand 3100 states and 5020 transitions. Second operand 7 states.