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_spec2_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:41:52,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:41:52,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:41:52,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:41:52,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:41:52,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:41:52,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:41:52,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:41:52,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:41:52,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:41:52,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:41:52,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:41:52,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:41:52,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:41:52,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:41:52,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:41:52,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:41:52,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:41:52,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:41:52,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:41:52,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:41:52,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:41:53,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:41:53,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:41:53,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:41:53,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:41:53,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:41:53,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:41:53,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:41:53,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:41:53,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:41:53,013 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:41:53,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:41:53,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:41:53,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:41:53,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:41:53,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:41:53,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:41:53,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:41:53,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:41:53,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:41:53,019 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:41:53,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:41:53,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:41:53,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:41:53,034 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:41:53,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:41:53,035 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:41:53,035 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:41:53,035 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:41:53,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:41:53,036 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:41:53,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:41:53,037 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:41:53,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:41:53,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:41:53,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:41:53,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:41:53,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:41:53,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:41:53,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:41:53,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:41:53,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:41:53,039 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:41:53,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:41:53,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:41:53,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:41:53,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:41:53,040 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:41:53,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:41:53,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:41:53,040 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:41:53,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:41:53,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:41:53,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:41:53,089 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:41:53,089 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:41:53,090 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-03 02:41:53,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c96d9c6/e9276e12fd5a45e4a05cf9d82564dba3/FLAG6bfa3ec61 [2019-10-03 02:41:53,799 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:41:53,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product24.cil.c [2019-10-03 02:41:53,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c96d9c6/e9276e12fd5a45e4a05cf9d82564dba3/FLAG6bfa3ec61 [2019-10-03 02:41:53,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c96d9c6/e9276e12fd5a45e4a05cf9d82564dba3 [2019-10-03 02:41:54,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:41:54,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:41:54,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:41:54,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:41:54,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:41:54,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:41:53" (1/1) ... [2019-10-03 02:41:54,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f77762e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:54, skipping insertion in model container [2019-10-03 02:41:54,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:41:53" (1/1) ... [2019-10-03 02:41:54,031 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:41:54,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:41:54,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:41:54,916 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:41:55,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:41:55,189 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:41:55,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55 WrapperNode [2019-10-03 02:41:55,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:41:55,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:41:55,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:41:55,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:41:55,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (1/1) ... [2019-10-03 02:41:55,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:41:55,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:41:55,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:41:55,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:41:55,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (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:41:55,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:41:55,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:41:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:41:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:41:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:41:55,511 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:41:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:41:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:41:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:41:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:41:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:41:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:41:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:41:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:41:55,513 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:41:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:41:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:41:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:41:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:41:55,514 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:41:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:41:55,516 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:41:55,517 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:41:55,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:41:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:41:55,520 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:41:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:41:55,522 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:41:55,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:41:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:41:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:41:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:41:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:41:55,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:41:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:41:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:41:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:41:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:41:55,525 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:41:55,526 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:41:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:41:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:41:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:41:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:41:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:41:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:41:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:41:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:41:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:41:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:41:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:41:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:41:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:41:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:41:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:41:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:41:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:41:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:41:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:41:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:41:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:41:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:41:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:41:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:41:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:41:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:41:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:41:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:41:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:41:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:41:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:41:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:41:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:41:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:41:58,024 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:41:58,024 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:41:58,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:58 BoogieIcfgContainer [2019-10-03 02:41:58,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:41:58,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:41:58,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:41:58,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:41:58,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:41:53" (1/3) ... [2019-10-03 02:41:58,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a111c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:58, skipping insertion in model container [2019-10-03 02:41:58,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:55" (2/3) ... [2019-10-03 02:41:58,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a111c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:58, skipping insertion in model container [2019-10-03 02:41:58,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:58" (3/3) ... [2019-10-03 02:41:58,035 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product24.cil.c [2019-10-03 02:41:58,046 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:41:58,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:41:58,075 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:41:58,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:41:58,114 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:41:58,115 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:41:58,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:41:58,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:41:58,115 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:41:58,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:41:58,115 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:41:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-03 02:41:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:41:58,195 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:58,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:58,201 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:58,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1311658421, now seen corresponding path program 1 times [2019-10-03 02:41:58,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:58,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:58,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:58,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:58,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:58,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:58,900 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-03 02:41:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:59,120 INFO L93 Difference]: Finished difference Result 661 states and 1041 transitions. [2019-10-03 02:41:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:59,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 02:41:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:59,157 INFO L225 Difference]: With dead ends: 661 [2019-10-03 02:41:59,158 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:41:59,160 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:41:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:41:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-03 02:41:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-03 02:41:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1029 transitions. [2019-10-03 02:41:59,273 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1029 transitions. Word has length 85 [2019-10-03 02:41:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:59,273 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1029 transitions. [2019-10-03 02:41:59,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1029 transitions. [2019-10-03 02:41:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 02:41:59,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:59,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:59,279 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:59,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1025593736, now seen corresponding path program 1 times [2019-10-03 02:41:59,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:59,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:59,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:59,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:59,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:59,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:59,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:59,532 INFO L87 Difference]: Start difference. First operand 650 states and 1029 transitions. Second operand 4 states. [2019-10-03 02:41:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:59,609 INFO L93 Difference]: Finished difference Result 652 states and 1030 transitions. [2019-10-03 02:41:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:59,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-03 02:41:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:59,620 INFO L225 Difference]: With dead ends: 652 [2019-10-03 02:41:59,624 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:41:59,625 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:41:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:41:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-03 02:41:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-03 02:41:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1028 transitions. [2019-10-03 02:41:59,696 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1028 transitions. Word has length 88 [2019-10-03 02:41:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:59,697 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1028 transitions. [2019-10-03 02:41:59,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1028 transitions. [2019-10-03 02:41:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 02:41:59,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:59,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:59,702 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1118647296, now seen corresponding path program 1 times [2019-10-03 02:41:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:59,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:59,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:59,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:59,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:59,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:59,877 INFO L87 Difference]: Start difference. First operand 650 states and 1028 transitions. Second operand 4 states. [2019-10-03 02:41:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:59,939 INFO L93 Difference]: Finished difference Result 652 states and 1029 transitions. [2019-10-03 02:41:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:59,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-03 02:41:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:59,950 INFO L225 Difference]: With dead ends: 652 [2019-10-03 02:41:59,950 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:41:59,951 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:41:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:41:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-03 02:41:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-03 02:41:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1027 transitions. [2019-10-03 02:41:59,983 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1027 transitions. Word has length 89 [2019-10-03 02:41:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:59,984 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1027 transitions. [2019-10-03 02:41:59,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1027 transitions. [2019-10-03 02:41:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:41:59,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:59,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:59,986 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash -210310140, now seen corresponding path program 1 times [2019-10-03 02:41:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:59,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:59,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:00,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:00,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:00,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:00,180 INFO L87 Difference]: Start difference. First operand 650 states and 1027 transitions. Second operand 4 states. [2019-10-03 02:42:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:00,245 INFO L93 Difference]: Finished difference Result 652 states and 1028 transitions. [2019-10-03 02:42:00,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:00,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:42:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:00,259 INFO L225 Difference]: With dead ends: 652 [2019-10-03 02:42:00,259 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:42:00,260 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:42:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:42:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-03 02:42:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-03 02:42:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1026 transitions. [2019-10-03 02:42:00,286 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1026 transitions. Word has length 90 [2019-10-03 02:42:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:00,287 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1026 transitions. [2019-10-03 02:42:00,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1026 transitions. [2019-10-03 02:42:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:42:00,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:00,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:00,289 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1623031804, now seen corresponding path program 1 times [2019-10-03 02:42:00,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:00,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:00,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:00,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:00,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:00,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:00,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:00,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:00,411 INFO L87 Difference]: Start difference. First operand 650 states and 1026 transitions. Second operand 4 states. [2019-10-03 02:42:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:00,472 INFO L93 Difference]: Finished difference Result 652 states and 1027 transitions. [2019-10-03 02:42:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:00,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:42:00,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:00,482 INFO L225 Difference]: With dead ends: 652 [2019-10-03 02:42:00,482 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:42:00,483 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:42:00,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:42:00,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-10-03 02:42:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-03 02:42:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1025 transitions. [2019-10-03 02:42:00,510 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1025 transitions. Word has length 91 [2019-10-03 02:42:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:00,511 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1025 transitions. [2019-10-03 02:42:00,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1025 transitions. [2019-10-03 02:42:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:42:00,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:00,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:00,516 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1591560576, now seen corresponding path program 1 times [2019-10-03 02:42:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:00,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:00,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:00,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:00,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:42:00,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:00,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:42:00,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:42:00,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:42:00,724 INFO L87 Difference]: Start difference. First operand 650 states and 1025 transitions. Second operand 10 states. [2019-10-03 02:42:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:00,876 INFO L93 Difference]: Finished difference Result 659 states and 1036 transitions. [2019-10-03 02:42:00,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:42:00,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-03 02:42:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:00,882 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:42:00,882 INFO L226 Difference]: Without dead ends: 659 [2019-10-03 02:42:00,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:42:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-03 02:42:00,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2019-10-03 02:42:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:42:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-10-03 02:42:00,937 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-10-03 02:42:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:00,938 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-10-03 02:42:00,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:42:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-10-03 02:42:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:42:00,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:00,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:00,942 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1571223201, now seen corresponding path program 1 times [2019-10-03 02:42:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:01,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:01,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:01,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:01,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:01,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:01,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:01,057 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-10-03 02:42:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:01,109 INFO L93 Difference]: Finished difference Result 655 states and 1029 transitions. [2019-10-03 02:42:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:01,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:42:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:01,116 INFO L225 Difference]: With dead ends: 655 [2019-10-03 02:42:01,116 INFO L226 Difference]: Without dead ends: 644 [2019-10-03 02:42:01,116 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:42:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-03 02:42:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-03 02:42:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-03 02:42:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1011 transitions. [2019-10-03 02:42:01,144 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1011 transitions. Word has length 92 [2019-10-03 02:42:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:01,145 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1011 transitions. [2019-10-03 02:42:01,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1011 transitions. [2019-10-03 02:42:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:42:01,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:01,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:01,150 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:01,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash -120264268, now seen corresponding path program 1 times [2019-10-03 02:42:01,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:01,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:01,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:01,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:01,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:01,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:01,317 INFO L87 Difference]: Start difference. First operand 644 states and 1011 transitions. Second operand 6 states. [2019-10-03 02:42:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:01,514 INFO L93 Difference]: Finished difference Result 647 states and 1014 transitions. [2019-10-03 02:42:01,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:01,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-03 02:42:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:01,520 INFO L225 Difference]: With dead ends: 647 [2019-10-03 02:42:01,521 INFO L226 Difference]: Without dead ends: 644 [2019-10-03 02:42:01,521 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:42:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-03 02:42:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-03 02:42:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-03 02:42:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1007 transitions. [2019-10-03 02:42:01,544 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1007 transitions. Word has length 93 [2019-10-03 02:42:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:01,544 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1007 transitions. [2019-10-03 02:42:01,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1007 transitions. [2019-10-03 02:42:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:42:01,546 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:01,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:01,547 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1667290269, now seen corresponding path program 1 times [2019-10-03 02:42:01,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:01,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:01,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:01,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:01,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:01,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:01,665 INFO L87 Difference]: Start difference. First operand 644 states and 1007 transitions. Second operand 6 states. [2019-10-03 02:42:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:01,856 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2019-10-03 02:42:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:01,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-03 02:42:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:01,862 INFO L225 Difference]: With dead ends: 647 [2019-10-03 02:42:01,863 INFO L226 Difference]: Without dead ends: 644 [2019-10-03 02:42:01,863 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:42:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-03 02:42:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-03 02:42:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-03 02:42:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1003 transitions. [2019-10-03 02:42:01,884 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1003 transitions. Word has length 94 [2019-10-03 02:42:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:01,885 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 1003 transitions. [2019-10-03 02:42:01,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1003 transitions. [2019-10-03 02:42:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:42:01,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:01,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:01,888 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1875714457, now seen corresponding path program 1 times [2019-10-03 02:42:01,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:01,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:02,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:02,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:02,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:02,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:02,016 INFO L87 Difference]: Start difference. First operand 644 states and 1003 transitions. Second operand 6 states. [2019-10-03 02:42:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:02,281 INFO L93 Difference]: Finished difference Result 647 states and 1006 transitions. [2019-10-03 02:42:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:02,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:42:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:02,286 INFO L225 Difference]: With dead ends: 647 [2019-10-03 02:42:02,286 INFO L226 Difference]: Without dead ends: 644 [2019-10-03 02:42:02,287 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:42:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-03 02:42:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-03 02:42:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-03 02:42:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 999 transitions. [2019-10-03 02:42:02,310 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 999 transitions. Word has length 95 [2019-10-03 02:42:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:02,310 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 999 transitions. [2019-10-03 02:42:02,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 999 transitions. [2019-10-03 02:42:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:42:02,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:02,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:02,312 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1371398631, now seen corresponding path program 1 times [2019-10-03 02:42:02,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:02,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:02,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:02,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:02,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:02,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:02,472 INFO L87 Difference]: Start difference. First operand 644 states and 999 transitions. Second operand 7 states. [2019-10-03 02:42:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:02,550 INFO L93 Difference]: Finished difference Result 647 states and 1002 transitions. [2019-10-03 02:42:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:42:02,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-03 02:42:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:02,556 INFO L225 Difference]: With dead ends: 647 [2019-10-03 02:42:02,556 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:42:02,557 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:42:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:42:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:42:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:42:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 965 transitions. [2019-10-03 02:42:02,595 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 965 transitions. Word has length 95 [2019-10-03 02:42:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:02,596 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 965 transitions. [2019-10-03 02:42:02,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 965 transitions. [2019-10-03 02:42:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:42:02,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:02,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:02,598 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 914472, now seen corresponding path program 1 times [2019-10-03 02:42:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:02,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:02,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:02,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:02,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:02,755 INFO L87 Difference]: Start difference. First operand 623 states and 965 transitions. Second operand 6 states. [2019-10-03 02:42:02,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:02,843 INFO L93 Difference]: Finished difference Result 626 states and 968 transitions. [2019-10-03 02:42:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:02,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:42:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:02,849 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:42:02,849 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:42:02,849 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:42:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:42:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:42:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:42:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 964 transitions. [2019-10-03 02:42:02,870 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 964 transitions. Word has length 96 [2019-10-03 02:42:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:02,872 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 964 transitions. [2019-10-03 02:42:02,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 964 transitions. [2019-10-03 02:42:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:42:02,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:02,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:02,874 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1972860286, now seen corresponding path program 1 times [2019-10-03 02:42:02,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:02,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:02,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:03,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:03,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:03,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:03,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:03,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:03,017 INFO L87 Difference]: Start difference. First operand 623 states and 964 transitions. Second operand 6 states. [2019-10-03 02:42:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:03,131 INFO L93 Difference]: Finished difference Result 626 states and 967 transitions. [2019-10-03 02:42:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:03,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:42:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:03,139 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:42:03,139 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:42:03,140 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:42:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:42:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:42:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:42:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 963 transitions. [2019-10-03 02:42:03,160 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 963 transitions. Word has length 97 [2019-10-03 02:42:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:03,160 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 963 transitions. [2019-10-03 02:42:03,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 963 transitions. [2019-10-03 02:42:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:42:03,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:03,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:03,162 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1360125715, now seen corresponding path program 1 times [2019-10-03 02:42:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:03,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:03,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:03,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:03,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:03,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:03,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:42:03,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:03,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:42:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:42:03,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:03,349 INFO L87 Difference]: Start difference. First operand 623 states and 963 transitions. Second operand 12 states. [2019-10-03 02:42:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:03,558 INFO L93 Difference]: Finished difference Result 627 states and 966 transitions. [2019-10-03 02:42:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:42:03,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-03 02:42:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:03,563 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:42:03,564 INFO L226 Difference]: Without dead ends: 623 [2019-10-03 02:42:03,565 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:42:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-03 02:42:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-03 02:42:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-03 02:42:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 962 transitions. [2019-10-03 02:42:03,594 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 962 transitions. Word has length 98 [2019-10-03 02:42:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:03,594 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 962 transitions. [2019-10-03 02:42:03,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:42:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 962 transitions. [2019-10-03 02:42:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:42:03,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:03,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:03,596 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash 372702175, now seen corresponding path program 1 times [2019-10-03 02:42:03,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:03,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:03,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:03,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:03,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:03,768 INFO L87 Difference]: Start difference. First operand 623 states and 962 transitions. Second operand 6 states. [2019-10-03 02:42:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:08,074 INFO L93 Difference]: Finished difference Result 1290 states and 2043 transitions. [2019-10-03 02:42:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:08,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:42:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:08,084 INFO L225 Difference]: With dead ends: 1290 [2019-10-03 02:42:08,084 INFO L226 Difference]: Without dead ends: 1290 [2019-10-03 02:42:08,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:08,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-03 02:42:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1165. [2019-10-03 02:42:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-10-03 02:42:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1844 transitions. [2019-10-03 02:42:08,134 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1844 transitions. Word has length 99 [2019-10-03 02:42:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:08,134 INFO L475 AbstractCegarLoop]: Abstraction has 1165 states and 1844 transitions. [2019-10-03 02:42:08,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1844 transitions. [2019-10-03 02:42:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:42:08,141 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:08,142 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:08,145 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1606765813, now seen corresponding path program 1 times [2019-10-03 02:42:08,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:08,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:08,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:08,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:08,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:42:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:42:08,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:08,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:42:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:42:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:08,394 INFO L87 Difference]: Start difference. First operand 1165 states and 1844 transitions. Second operand 12 states. [2019-10-03 02:42:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:20,063 INFO L93 Difference]: Finished difference Result 2735 states and 4277 transitions. [2019-10-03 02:42:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:42:20,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-03 02:42:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:20,080 INFO L225 Difference]: With dead ends: 2735 [2019-10-03 02:42:20,080 INFO L226 Difference]: Without dead ends: 2735 [2019-10-03 02:42:20,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:42:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-10-03 02:42:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2677. [2019-10-03 02:42:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2677 states. [2019-10-03 02:42:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4197 transitions. [2019-10-03 02:42:20,170 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4197 transitions. Word has length 157 [2019-10-03 02:42:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:20,170 INFO L475 AbstractCegarLoop]: Abstraction has 2677 states and 4197 transitions. [2019-10-03 02:42:20,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:42:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4197 transitions. [2019-10-03 02:42:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:42:20,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:20,176 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:20,176 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1417866634, now seen corresponding path program 1 times [2019-10-03 02:42:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:20,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:20,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:20,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:20,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:42:20,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:42:20,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:42:20,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:42:20,327 INFO L207 CegarAbsIntRunner]: [213], [215], [217], [246], [265], [267], [270], [272], [276], [388], [390], [409], [429], [449], [469], [489], [491], [520], [521], [522], [524], [527], [532], [540], [543], [605], [606], [688], [689], [977], [978], [1051], [1055], [1058], [1093], [1095], [1096], [1110], [1111], [1113], [1122], [1124], [1137], [1150], [1155], [1156], [1157], [1162], [1228], [1230], [1233], [1235], [1241], [1245], [1246], [1282], [1285], [1290], [1295], [1300], [1305], [1310], [1313], [1429], [1438], [1443], [1446], [1465], [1654], [1658], [1662], [1666], [1670], [1674], [1677], [1679], [1680], [1693], [1696], [1702], [1706], [2263], [2267], [2270], [2288], [2380], [2382], [2479], [2482], [2487], [2490], [2508], [2523], [2524], [2525], [2526], [2559], [2560], [2561], [2562], [2587], [2588], [2599], [2600], [2601], [2602], [2605], [2606], [2607], [2771], [2772], [2773], [2774], [2775], [2776], [2777], [2778], [2779], [2785], [2786], [2791], [2792], [2793], [2794], [2795], [2796], [2807], [2808], [2809], [2810], [2815], [2816], [2823], [2824], [2825], [2826], [2827], [2859], [2860], [2861], [2875], [2876], [2905], [2906], [2907], [2908] [2019-10-03 02:42:20,400 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:42:20,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:42:20,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:42:20,509 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 191 root evaluator evaluations with a maximum evaluation depth of 0. Performed 191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-10-03 02:42:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:20,514 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:42:20,576 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:42:20,576 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:42:20,581 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:42:20,581 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:42:20,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:42:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:42:20,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:20,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:42:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:42:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:42:20,584 INFO L87 Difference]: Start difference. First operand 2677 states and 4197 transitions. Second operand 2 states. [2019-10-03 02:42:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:20,585 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:42:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:42:20,585 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-03 02:42:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:20,585 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:42:20,586 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:42:20,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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:42:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:42:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:42:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:42:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:42:20,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-10-03 02:42:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:20,587 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:42:20,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:42:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:42:20,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:42:20,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:42:20 BoogieIcfgContainer [2019-10-03 02:42:20,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:42:20,596 INFO L168 Benchmark]: Toolchain (without parser) took 26584.39 ms. Allocated memory was 133.2 MB in the beginning and 622.3 MB in the end (delta: 489.2 MB). Free memory was 85.5 MB in the beginning and 75.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 498.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:20,597 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 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:42:20,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1175.79 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 85.3 MB in the beginning and 138.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:20,598 INFO L168 Benchmark]: Boogie Preprocessor took 240.59 ms. Allocated memory is still 201.9 MB. Free memory was 138.7 MB in the beginning and 129.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:20,600 INFO L168 Benchmark]: RCFGBuilder took 2594.96 ms. Allocated memory was 201.9 MB in the beginning and 267.4 MB in the end (delta: 65.5 MB). Free memory was 129.1 MB in the beginning and 139.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:20,600 INFO L168 Benchmark]: TraceAbstraction took 22565.76 ms. Allocated memory was 267.4 MB in the beginning and 622.3 MB in the end (delta: 354.9 MB). Free memory was 137.1 MB in the beginning and 75.8 MB in the end (delta: 61.3 MB). Peak memory consumption was 416.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:20,605 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1175.79 ms. Allocated memory was 133.2 MB in the beginning and 201.9 MB in the end (delta: 68.7 MB). Free memory was 85.3 MB in the beginning and 138.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 240.59 ms. Allocated memory is still 201.9 MB. Free memory was 138.7 MB in the beginning and 129.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2594.96 ms. Allocated memory was 201.9 MB in the beginning and 267.4 MB in the end (delta: 65.5 MB). Free memory was 129.1 MB in the beginning and 139.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22565.76 ms. Allocated memory was 267.4 MB in the beginning and 622.3 MB in the end (delta: 354.9 MB). Free memory was 137.1 MB in the beginning and 75.8 MB in the end (delta: 61.3 MB). Peak memory consumption was 416.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3072]: 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 82 procedures, 956 locations, 1 error locations. SAFE Result, 22.4s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 18.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16471 SDtfs, 5136 SDslu, 55441 SDs, 0 SdLazy, 16915 SolverSat, 1711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2677occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.605095541401274 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 185 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 256558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...