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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:30,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:30,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:30,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:30,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:30,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:30,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:30,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:30,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:30,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:30,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:30,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:30,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:30,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:30,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:30,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:30,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:30,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:30,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:30,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:30,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:30,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:30,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:30,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:30,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:30,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:30,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:30,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:30,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:30,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:30,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:30,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:30,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:30,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:30,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:30,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:30,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:30,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:30,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:30,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:30,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:30,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:39:31,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:31,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:31,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:31,006 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:31,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:31,007 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:31,007 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:31,007 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:31,008 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:31,008 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:31,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:31,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:31,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:31,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:31,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:31,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:31,010 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:31,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:31,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:31,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:31,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:31,011 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:31,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:31,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:31,012 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:31,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:31,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:31,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:31,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:31,063 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:31,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-10-03 02:39:31,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4722ce627/f8721632e6174ff7943c398f3ff5cf56/FLAG3f84eb280 [2019-10-03 02:39:31,775 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:31,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-10-03 02:39:31,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4722ce627/f8721632e6174ff7943c398f3ff5cf56/FLAG3f84eb280 [2019-10-03 02:39:31,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4722ce627/f8721632e6174ff7943c398f3ff5cf56 [2019-10-03 02:39:31,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:31,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:31,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:31,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:31,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:31,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:31" (1/1) ... [2019-10-03 02:39:31,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bd23e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:31, skipping insertion in model container [2019-10-03 02:39:31,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:31" (1/1) ... [2019-10-03 02:39:31,967 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:32,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:32,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:32,802 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:32,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:33,068 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:33,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33 WrapperNode [2019-10-03 02:39:33,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:33,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:33,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:33,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:33,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (1/1) ... [2019-10-03 02:39:33,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:33,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:33,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:33,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:33,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (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-10-03 02:39:33,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:33,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:33,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:33,368 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:33,368 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:33,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:33,369 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:33,370 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:33,370 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:33,371 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:33,371 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:33,372 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:33,372 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:33,373 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:33,374 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:33,375 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:33,375 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:33,376 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:33,376 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:33,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:33,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:33,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:33,381 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:33,382 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:39:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:33,383 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:33,385 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:39:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:33,386 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:39:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:33,387 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:33,388 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:33,388 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:33,391 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:33,392 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:33,392 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:33,393 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:33,393 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:33,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:33,394 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:33,395 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:33,397 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:33,399 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:33,400 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:33,401 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:33,402 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:33,403 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:33,404 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:33,405 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:33,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:33,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:33,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:33,419 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:33,425 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:33,426 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:33,427 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:35,734 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:35,734 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:35,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:35 BoogieIcfgContainer [2019-10-03 02:39:35,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:35,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:35,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:35,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:35,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:31" (1/3) ... [2019-10-03 02:39:35,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0d7e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:35, skipping insertion in model container [2019-10-03 02:39:35,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:33" (2/3) ... [2019-10-03 02:39:35,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0d7e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:35, skipping insertion in model container [2019-10-03 02:39:35,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:35" (3/3) ... [2019-10-03 02:39:35,747 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product23.cil.c [2019-10-03 02:39:35,757 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:35,772 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:35,789 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:35,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:35,818 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:35,818 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:35,818 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:35,818 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:35,818 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:35,818 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:35,819 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states. [2019-10-03 02:39:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:39:35,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:35,884 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:35,886 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:35,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1117426819, now seen corresponding path program 1 times [2019-10-03 02:39:35,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:35,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:36,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:36,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:36,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:36,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:36,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:36,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:36,540 INFO L87 Difference]: Start difference. First operand 766 states. Second operand 4 states. [2019-10-03 02:39:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:36,762 INFO L93 Difference]: Finished difference Result 629 states and 985 transitions. [2019-10-03 02:39:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:36,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-03 02:39:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:36,789 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:36,790 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:39:36,791 INFO L640 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-10-03 02:39:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:39:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:39:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:39:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 971 transitions. [2019-10-03 02:39:36,898 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 971 transitions. Word has length 135 [2019-10-03 02:39:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:36,898 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 971 transitions. [2019-10-03 02:39:36,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 971 transitions. [2019-10-03 02:39:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:39:36,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:36,919 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:36,919 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:36,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1099628587, now seen corresponding path program 1 times [2019-10-03 02:39:36,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:36,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:37,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:37,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:37,180 INFO L87 Difference]: Start difference. First operand 618 states and 971 transitions. Second operand 4 states. [2019-10-03 02:39:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:37,274 INFO L93 Difference]: Finished difference Result 620 states and 972 transitions. [2019-10-03 02:39:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:37,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:39:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:37,284 INFO L225 Difference]: With dead ends: 620 [2019-10-03 02:39:37,284 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:39:37,287 INFO L640 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-10-03 02:39:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:39:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:39:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:39:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 970 transitions. [2019-10-03 02:39:37,348 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 970 transitions. Word has length 136 [2019-10-03 02:39:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:37,351 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 970 transitions. [2019-10-03 02:39:37,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 970 transitions. [2019-10-03 02:39:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:39:37,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:37,365 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:37,372 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 896519935, now seen corresponding path program 1 times [2019-10-03 02:39:37,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:37,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:37,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:37,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:37,613 INFO L87 Difference]: Start difference. First operand 618 states and 970 transitions. Second operand 4 states. [2019-10-03 02:39:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:37,684 INFO L93 Difference]: Finished difference Result 620 states and 971 transitions. [2019-10-03 02:39:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:37,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:39:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:37,691 INFO L225 Difference]: With dead ends: 620 [2019-10-03 02:39:37,691 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:39:37,692 INFO L640 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-10-03 02:39:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:39:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:39:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:39:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 969 transitions. [2019-10-03 02:39:37,725 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 969 transitions. Word has length 137 [2019-10-03 02:39:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:37,725 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 969 transitions. [2019-10-03 02:39:37,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 969 transitions. [2019-10-03 02:39:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:39:37,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:37,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:37,731 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -756244441, now seen corresponding path program 1 times [2019-10-03 02:39:37,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:37,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:37,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:37,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:37,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:37,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:37,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:37,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:37,870 INFO L87 Difference]: Start difference. First operand 618 states and 969 transitions. Second operand 4 states. [2019-10-03 02:39:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:37,948 INFO L93 Difference]: Finished difference Result 620 states and 970 transitions. [2019-10-03 02:39:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:37,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:39:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:37,959 INFO L225 Difference]: With dead ends: 620 [2019-10-03 02:39:37,959 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:39:37,960 INFO L640 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-10-03 02:39:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:39:37,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:39:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:39:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 968 transitions. [2019-10-03 02:39:38,004 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 968 transitions. Word has length 138 [2019-10-03 02:39:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:38,005 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 968 transitions. [2019-10-03 02:39:38,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 968 transitions. [2019-10-03 02:39:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:39:38,015 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:38,015 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:38,015 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -103696005, now seen corresponding path program 1 times [2019-10-03 02:39:38,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:38,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:38,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:38,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:38,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:38,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:38,220 INFO L87 Difference]: Start difference. First operand 618 states and 968 transitions. Second operand 4 states. [2019-10-03 02:39:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:38,306 INFO L93 Difference]: Finished difference Result 620 states and 969 transitions. [2019-10-03 02:39:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:38,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:39:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:38,316 INFO L225 Difference]: With dead ends: 620 [2019-10-03 02:39:38,317 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:39:38,317 INFO L640 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-10-03 02:39:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:39:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-03 02:39:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-03 02:39:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 967 transitions. [2019-10-03 02:39:38,351 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 967 transitions. Word has length 139 [2019-10-03 02:39:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:38,352 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 967 transitions. [2019-10-03 02:39:38,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 967 transitions. [2019-10-03 02:39:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:38,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:38,363 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:38,363 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1000894429, now seen corresponding path program 1 times [2019-10-03 02:39:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:38,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:38,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:38,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:38,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:38,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:38,760 INFO L87 Difference]: Start difference. First operand 618 states and 967 transitions. Second operand 10 states. [2019-10-03 02:39:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,018 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2019-10-03 02:39:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:39,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:39:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,026 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:39:39,026 INFO L226 Difference]: Without dead ends: 627 [2019-10-03 02:39:39,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:39:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-03 02:39:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-10-03 02:39:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-10-03 02:39:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-10-03 02:39:39,058 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 977 transitions. Word has length 140 [2019-10-03 02:39:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,059 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-10-03 02:39:39,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 977 transitions. [2019-10-03 02:39:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:39,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,064 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:39,064 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1987477118, now seen corresponding path program 1 times [2019-10-03 02:39:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:39,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:39,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:39,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:39,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:39,201 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. Second operand 4 states. [2019-10-03 02:39:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,250 INFO L93 Difference]: Finished difference Result 623 states and 972 transitions. [2019-10-03 02:39:39,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:39,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:39:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,255 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:39:39,256 INFO L226 Difference]: Without dead ends: 621 [2019-10-03 02:39:39,256 INFO L640 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-10-03 02:39:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-03 02:39:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-03 02:39:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-03 02:39:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 970 transitions. [2019-10-03 02:39:39,280 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 970 transitions. Word has length 140 [2019-10-03 02:39:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,281 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 970 transitions. [2019-10-03 02:39:39,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 970 transitions. [2019-10-03 02:39:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:39:39,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,286 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:39,286 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1145901007, now seen corresponding path program 1 times [2019-10-03 02:39:39,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:39,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:39,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:39,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:39,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:39,448 INFO L87 Difference]: Start difference. First operand 621 states and 970 transitions. Second operand 6 states. [2019-10-03 02:39:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:39,798 INFO L93 Difference]: Finished difference Result 638 states and 991 transitions. [2019-10-03 02:39:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:39,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:39:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:39,805 INFO L225 Difference]: With dead ends: 638 [2019-10-03 02:39:39,805 INFO L226 Difference]: Without dead ends: 629 [2019-10-03 02:39:39,806 INFO L640 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-10-03 02:39:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-03 02:39:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2019-10-03 02:39:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:39:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 971 transitions. [2019-10-03 02:39:39,832 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 971 transitions. Word has length 141 [2019-10-03 02:39:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:39,832 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 971 transitions. [2019-10-03 02:39:39,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 971 transitions. [2019-10-03 02:39:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:39:39,841 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:39,842 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:39,842 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1935329146, now seen corresponding path program 1 times [2019-10-03 02:39:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:39,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:39,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:40,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:40,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:40,019 INFO L87 Difference]: Start difference. First operand 626 states and 971 transitions. Second operand 6 states. [2019-10-03 02:39:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:40,241 INFO L93 Difference]: Finished difference Result 629 states and 974 transitions. [2019-10-03 02:39:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:40,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:39:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:40,247 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:40,248 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:39:40,248 INFO L640 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-10-03 02:39:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:39:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:39:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:39:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 967 transitions. [2019-10-03 02:39:40,273 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 967 transitions. Word has length 142 [2019-10-03 02:39:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:40,274 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 967 transitions. [2019-10-03 02:39:40,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 967 transitions. [2019-10-03 02:39:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:40,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:40,280 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:40,280 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash 210411572, now seen corresponding path program 1 times [2019-10-03 02:39:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:40,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:40,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:40,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:40,426 INFO L87 Difference]: Start difference. First operand 626 states and 967 transitions. Second operand 6 states. [2019-10-03 02:39:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:40,665 INFO L93 Difference]: Finished difference Result 629 states and 970 transitions. [2019-10-03 02:39:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:40,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:39:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:40,672 INFO L225 Difference]: With dead ends: 629 [2019-10-03 02:39:40,672 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:39:40,672 INFO L640 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-10-03 02:39:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:39:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-03 02:39:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-03 02:39:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 963 transitions. [2019-10-03 02:39:40,700 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 963 transitions. Word has length 143 [2019-10-03 02:39:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:40,701 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 963 transitions. [2019-10-03 02:39:40,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 963 transitions. [2019-10-03 02:39:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:40,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:40,709 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:40,709 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 487742644, now seen corresponding path program 1 times [2019-10-03 02:39:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:40,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:40,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:40,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:40,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:40,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:40,996 INFO L87 Difference]: Start difference. First operand 626 states and 963 transitions. Second operand 7 states. [2019-10-03 02:39:41,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:41,135 INFO L93 Difference]: Finished difference Result 632 states and 970 transitions. [2019-10-03 02:39:41,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:41,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:39:41,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:41,144 INFO L225 Difference]: With dead ends: 632 [2019-10-03 02:39:41,144 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:39:41,145 INFO L640 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-10-03 02:39:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:39:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2019-10-03 02:39:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-03 02:39:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 926 transitions. [2019-10-03 02:39:41,172 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 926 transitions. Word has length 143 [2019-10-03 02:39:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:41,173 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 926 transitions. [2019-10-03 02:39:41,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 926 transitions. [2019-10-03 02:39:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:39:41,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:41,179 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:41,179 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:41,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1183492043, now seen corresponding path program 1 times [2019-10-03 02:39:41,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:41,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:41,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:41,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:41,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:41,348 INFO L87 Difference]: Start difference. First operand 605 states and 926 transitions. Second operand 6 states. [2019-10-03 02:39:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:41,471 INFO L93 Difference]: Finished difference Result 608 states and 929 transitions. [2019-10-03 02:39:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:41,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:39:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:41,477 INFO L225 Difference]: With dead ends: 608 [2019-10-03 02:39:41,477 INFO L226 Difference]: Without dead ends: 605 [2019-10-03 02:39:41,478 INFO L640 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-10-03 02:39:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-03 02:39:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-03 02:39:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-03 02:39:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 925 transitions. [2019-10-03 02:39:41,498 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 925 transitions. Word has length 144 [2019-10-03 02:39:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:41,498 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 925 transitions. [2019-10-03 02:39:41,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 925 transitions. [2019-10-03 02:39:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:39:41,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:41,504 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:41,504 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash 163843225, now seen corresponding path program 1 times [2019-10-03 02:39:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:41,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:41,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:41,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:41,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:41,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:41,643 INFO L87 Difference]: Start difference. First operand 605 states and 925 transitions. Second operand 6 states. [2019-10-03 02:39:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:41,759 INFO L93 Difference]: Finished difference Result 608 states and 928 transitions. [2019-10-03 02:39:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:41,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:39:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:41,765 INFO L225 Difference]: With dead ends: 608 [2019-10-03 02:39:41,765 INFO L226 Difference]: Without dead ends: 605 [2019-10-03 02:39:41,766 INFO L640 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-10-03 02:39:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-03 02:39:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-03 02:39:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-03 02:39:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 924 transitions. [2019-10-03 02:39:41,785 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 924 transitions. Word has length 145 [2019-10-03 02:39:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:41,786 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 924 transitions. [2019-10-03 02:39:41,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 924 transitions. [2019-10-03 02:39:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:39:41,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:41,791 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:41,791 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1794095888, now seen corresponding path program 1 times [2019-10-03 02:39:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:41,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:42,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:42,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:42,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:42,030 INFO L87 Difference]: Start difference. First operand 605 states and 924 transitions. Second operand 12 states. [2019-10-03 02:39:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:42,347 INFO L93 Difference]: Finished difference Result 614 states and 934 transitions. [2019-10-03 02:39:42,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:42,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:39:42,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:42,353 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:39:42,353 INFO L226 Difference]: Without dead ends: 612 [2019-10-03 02:39:42,355 INFO L640 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-10-03 02:39:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-03 02:39:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-03 02:39:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-03 02:39:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 930 transitions. [2019-10-03 02:39:42,382 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 930 transitions. Word has length 146 [2019-10-03 02:39:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:42,384 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 930 transitions. [2019-10-03 02:39:42,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 930 transitions. [2019-10-03 02:39:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:39:42,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:42,390 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 02:39:42,390 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 114192712, now seen corresponding path program 1 times [2019-10-03 02:39:42,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:42,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:42,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:39:42,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:42,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:42,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:39:42,612 INFO L207 CegarAbsIntRunner]: [72], [73], [152], [156], [159], [350], [352], [354], [405], [406], [408], [409], [428], [430], [433], [435], [439], [567], [569], [666], [669], [674], [677], [741], [742], [743], [748], [815], [816], [848], [850], [853], [855], [861], [865], [866], [902], [905], [910], [915], [920], [925], [930], [933], [1049], [1054], [1055], [1104], [1109], [1112], [1131], [1316], [1320], [1324], [1328], [1332], [1336], [1339], [1341], [1357], [1370], [1373], [1379], [1383], [1384], [1386], [1389], [1391], [1393], [1398], [1400], [1403], [1509], [1510], [1775], [2197], [2200], [2218], [2393], [2394], [2395], [2396], [2397], [2398], [2399], [2400], [2401], [2411], [2412], [2413], [2414], [2439], [2440], [2449], [2450], [2451], [2452], [2459], [2460], [2461], [2489], [2490], [2519], [2520], [2521], [2522], [2533], [2553], [2554], [2555], [2556], [2561], [2562], [2563], [2569], [2595], [2596], [2597], [2598], [2599], [2600], [2601], [2602], [2603], [2655], [2656], [2657] [2019-10-03 02:39:42,678 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:42,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:42,804 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:42,806 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 136 root evaluator evaluations with a maximum evaluation depth of 0. Performed 136 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 254 variables. [2019-10-03 02:39:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:42,810 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:42,893 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:42,893 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:42,905 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:39:42,905 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:42,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:42,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-03 02:39:42,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:42,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:42,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:42,908 INFO L87 Difference]: Start difference. First operand 610 states and 930 transitions. Second operand 2 states. [2019-10-03 02:39:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:42,908 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:42,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:39:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:42,909 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:42,909 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:42,911 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:42,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:39:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:42,913 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:42,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:42,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:42,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:42 BoogieIcfgContainer [2019-10-03 02:39:42,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:42,923 INFO L168 Benchmark]: Toolchain (without parser) took 10971.64 ms. Allocated memory was 134.7 MB in the beginning and 467.1 MB in the end (delta: 332.4 MB). Free memory was 88.1 MB in the beginning and 219.0 MB in the end (delta: -131.0 MB). Peak memory consumption was 201.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,926 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1117.56 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 137.7 MB in the end (delta: -49.8 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,933 INFO L168 Benchmark]: Boogie Preprocessor took 182.91 ms. Allocated memory is still 201.3 MB. Free memory was 137.7 MB in the beginning and 128.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,934 INFO L168 Benchmark]: RCFGBuilder took 2483.84 ms. Allocated memory was 201.3 MB in the beginning and 260.0 MB in the end (delta: 58.7 MB). Free memory was 128.5 MB in the beginning and 136.9 MB in the end (delta: -8.4 MB). Peak memory consumption was 90.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,935 INFO L168 Benchmark]: TraceAbstraction took 7181.07 ms. Allocated memory was 260.0 MB in the beginning and 467.1 MB in the end (delta: 207.1 MB). Free memory was 136.9 MB in the beginning and 219.0 MB in the end (delta: -82.2 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:42,948 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1117.56 ms. Allocated memory was 134.7 MB in the beginning and 201.3 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 137.7 MB in the end (delta: -49.8 MB). Peak memory consumption was 35.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 182.91 ms. Allocated memory is still 201.3 MB. Free memory was 137.7 MB in the beginning and 128.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2483.84 ms. Allocated memory was 201.3 MB in the beginning and 260.0 MB in the end (delta: 58.7 MB). Free memory was 128.5 MB in the beginning and 136.9 MB in the end (delta: -8.4 MB). Peak memory consumption was 90.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7181.07 ms. Allocated memory was 260.0 MB in the beginning and 467.1 MB in the end (delta: 207.1 MB). Free memory was 136.9 MB in the beginning and 219.0 MB in the end (delta: -82.2 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 77 procedures, 901 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12998 SDtfs, 538 SDslu, 50157 SDs, 0 SdLazy, 1689 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6712328767123288 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 360237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 530/540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...