java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:42:31,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:42:31,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:42:31,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:42:31,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:42:31,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:42:31,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:42:31,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:42:31,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:42:31,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:42:31,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:42:31,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:42:31,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:42:31,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:42:31,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:42:31,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:42:31,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:42:31,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:42:31,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:42:31,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:42:31,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:42:31,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:42:31,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:42:31,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:42:31,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:42:31,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:42:31,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:42:31,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:42:31,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:42:31,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:42:31,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:42:31,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:42:31,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:42:31,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:42:31,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:42:31,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:42:31,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:42:31,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:42:31,583 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:42:31,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:42:31,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:42:31,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:42:31,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:42:31,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:42:31,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:42:31,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:42:31,611 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:42:31,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:42:31,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:42:31,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:42:31,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:42:31,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:42:31,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:42:31,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:42:31,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:42:31,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:42:31,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:42:31,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:42:31,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:42:31,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:42:31,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:42:31,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:42:31,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:42:31,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:42:31,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:42:31,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:42:31,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:42:31,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:42:31,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:42:31,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:42:31,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:42:31,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:42:31,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:42:31,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:42:31,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:42:31,675 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:42:31,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2019-10-02 11:42:31,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f872171/662a257f7e1e438384f0404a68b17781/FLAG3d06f4ec5 [2019-10-02 11:42:32,500 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:42:32,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers/cdaudio.i.cil-1.c [2019-10-02 11:42:32,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f872171/662a257f7e1e438384f0404a68b17781/FLAG3d06f4ec5 [2019-10-02 11:42:33,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76f872171/662a257f7e1e438384f0404a68b17781 [2019-10-02 11:42:33,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:42:33,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:42:33,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:33,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:42:33,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:42:33,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:33" (1/1) ... [2019-10-02 11:42:33,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b857900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:33, skipping insertion in model container [2019-10-02 11:42:33,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:42:33" (1/1) ... [2019-10-02 11:42:33,065 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:42:33,235 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:42:34,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:34,887 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:42:35,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:42:35,481 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:42:35,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35 WrapperNode [2019-10-02 11:42:35,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:42:35,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:42:35,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:42:35,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:42:35,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:35,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:35,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:35,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:35,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:35,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:36,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (1/1) ... [2019-10-02 11:42:36,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:42:36,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:42:36,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:42:36,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:42:36,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (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-02 11:42:36,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:42:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:42:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2019-10-02 11:42:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2019-10-02 11:42:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2019-10-02 11:42:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2019-10-02 11:42:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2019-10-02 11:42:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-02 11:42:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-02 11:42:36,123 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-02 11:42:36,124 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAddDevice [2019-10-02 11:42:36,124 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-02 11:42:36,126 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-02 11:42:36,126 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-02 11:42:36,128 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2019-10-02 11:42:36,128 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2019-10-02 11:42:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioReadWrite [2019-10-02 11:42:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-02 11:42:36,129 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-02 11:42:36,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-02 11:42:36,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioNECDeviceControl [2019-10-02 11:42:36,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPioneerDeviceControl [2019-10-02 11:42:36,130 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDenonDeviceControl [2019-10-02 11:42:36,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiSendPauseCommand [2019-10-02 11:42:36,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHitachiDeviceControl [2019-10-02 11:42:36,131 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-02 11:42:36,132 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-02 11:42:36,132 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-02 11:42:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-02 11:42:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-02 11:42:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-02 11:42:36,133 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-02 11:42:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-02 11:42:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-02 11:42:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-02 11:42:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:42:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2019-10-02 11:42:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2019-10-02 11:42:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2019-10-02 11:42:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2019-10-02 11:42:36,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2019-10-02 11:42:36,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertHeadList [2019-10-02 11:42:36,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2019-10-02 11:42:36,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:42:36,137 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAllocateMdl [2019-10-02 11:42:36,137 INFO L138 BoogieDeclarations]: Found implementation of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:42:36,137 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:42:36,137 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:42:36,138 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateDevice [2019-10-02 11:42:36,138 INFO L138 BoogieDeclarations]: Found implementation of procedure IoCreateSymbolicLink [2019-10-02 11:42:36,138 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2019-10-02 11:42:36,138 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-02 11:42:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2019-10-02 11:42:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeIrp [2019-10-02 11:42:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure IoFreeMdl [2019-10-02 11:42:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2019-10-02 11:42:36,140 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-02 11:42:36,140 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-02 11:42:36,140 INFO L138 BoogieDeclarations]: Found implementation of procedure IoReleaseCancelSpinLock [2019-10-02 11:42:36,140 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-02 11:42:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:42:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-02 11:42:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-02 11:42:36,141 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-02 11:42:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:42:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure KeDelayExecutionThread [2019-10-02 11:42:36,142 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2019-10-02 11:42:36,143 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSemaphore [2019-10-02 11:42:36,143 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeSpinLock [2019-10-02 11:42:36,143 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2019-10-02 11:42:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure KfReleaseSpinLock [2019-10-02 11:42:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-02 11:42:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-02 11:42:36,144 INFO L138 BoogieDeclarations]: Found implementation of procedure MmAllocateContiguousMemory [2019-10-02 11:42:36,145 INFO L138 BoogieDeclarations]: Found implementation of procedure MmFreeContiguousMemory [2019-10-02 11:42:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:42:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2019-10-02 11:42:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2019-10-02 11:42:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure MmUnlockPages [2019-10-02 11:42:36,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-02 11:42:36,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2019-10-02 11:42:36,147 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-02 11:42:36,148 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2019-10-02 11:42:36,148 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-02 11:42:36,148 INFO L138 BoogieDeclarations]: Found implementation of procedure PsTerminateSystemThread [2019-10-02 11:42:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:42:36,149 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2019-10-02 11:42:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCopyUnicodeString [2019-10-02 11:42:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2019-10-02 11:42:36,150 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2019-10-02 11:42:36,151 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitString [2019-10-02 11:42:36,152 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2019-10-02 11:42:36,152 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2019-10-02 11:42:36,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-02 11:42:36,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 11:42:36,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 11:42:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:42:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 11:42:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:42:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 11:42:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 11:42:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:42:36,154 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 11:42:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-02 11:42:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 11:42:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2019-10-02 11:42:36,155 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2019-10-02 11:42:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2019-10-02 11:42:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitString [2019-10-02 11:42:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2019-10-02 11:42:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure RtlAnsiStringToUnicodeString [2019-10-02 11:42:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCopyUnicodeString [2019-10-02 11:42:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2019-10-02 11:42:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2019-10-02 11:42:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2019-10-02 11:42:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:42:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:42:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2019-10-02 11:42:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2019-10-02 11:42:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-02 11:42:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSemaphore [2019-10-02 11:42:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2019-10-02 11:42:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure KeDelayExecutionThread [2019-10-02 11:42:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-02 11:42:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeSpinLock [2019-10-02 11:42:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure KfReleaseSpinLock [2019-10-02 11:42:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2019-10-02 11:42:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2019-10-02 11:42:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2019-10-02 11:42:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2019-10-02 11:42:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertHeadList [2019-10-02 11:42:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2019-10-02 11:42:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2019-10-02 11:42:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure MmUnlockPages [2019-10-02 11:42:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure MmMapLockedPagesSpecifyCache [2019-10-02 11:42:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure MmAllocateContiguousMemory [2019-10-02 11:42:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure MmFreeContiguousMemory [2019-10-02 11:42:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2019-10-02 11:42:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2019-10-02 11:42:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2019-10-02 11:42:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-02 11:42:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure PsTerminateSystemThread [2019-10-02 11:42:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure IoAllocateMdl [2019-10-02 11:42:36,172 INFO L130 BoogieDeclarations]: Found specification of procedure IoAttachDeviceToDeviceStack [2019-10-02 11:42:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildAsynchronousFsdRequest [2019-10-02 11:42:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-02 11:42:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-02 11:42:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-02 11:42:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateDevice [2019-10-02 11:42:36,182 INFO L130 BoogieDeclarations]: Found specification of procedure IoCreateSymbolicLink [2019-10-02 11:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2019-10-02 11:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-02 11:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2019-10-02 11:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeIrp [2019-10-02 11:42:36,183 INFO L130 BoogieDeclarations]: Found specification of procedure IoFreeMdl [2019-10-02 11:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2019-10-02 11:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-02 11:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure IoReleaseCancelSpinLock [2019-10-02 11:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2019-10-02 11:42:36,184 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2019-10-02 11:42:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-02 11:42:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-02 11:42:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-02 11:42:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2019-10-02 11:42:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-02 11:42:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2019-10-02 11:42:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-02 11:42:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-02 11:42:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-02 11:42:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2019-10-02 11:42:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioReadWrite [2019-10-02 11:42:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-02 11:42:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-02 11:42:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-02 11:42:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2019-10-02 11:42:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioNECDeviceControl [2019-10-02 11:42:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPioneerDeviceControl [2019-10-02 11:42:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDenonDeviceControl [2019-10-02 11:42:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiSendPauseCommand [2019-10-02 11:42:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHitachiDeviceControl [2019-10-02 11:42:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-02 11:42:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-02 11:42:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-02 11:42:36,189 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-02 11:42:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-02 11:42:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-02 11:42:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-02 11:42:36,190 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-02 11:42:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-02 11:42:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-02 11:42:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:42:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:42:36,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:42:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAddDevice [2019-10-02 11:42:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 11:42:36,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:42:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-02 11:42:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-02 11:42:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-02 11:42:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 11:42:36,193 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-02 11:42:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:42:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:42:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2019-10-02 11:42:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-02 11:42:36,194 INFO L130 BoogieDeclarations]: Found specification of procedure KeAcquireSpinLockRaiseToDpc [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 11:42:36,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 11:42:37,849 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:37,902 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:37,902 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:37,903 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:37,915 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:37,915 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:37,926 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:37,937 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:37,937 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:37,938 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:37,955 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:37,955 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:37,959 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:50,059 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-02 11:42:50,059 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-02 11:42:50,080 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:50,091 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:50,091 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:50,092 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:50,109 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:50,110 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:50,110 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:50,123 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:50,123 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:50,124 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:42:50,142 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:42:50,142 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:42:50,147 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,527 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 11:43:08,528 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 11:43:08,603 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,828 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume false; [2019-10-02 11:43:08,828 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !false; [2019-10-02 11:43:08,840 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,853 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:08,854 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:08,854 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,889 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 11:43:08,889 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 11:43:08,889 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,897 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:08,898 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:08,898 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,910 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:08,910 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:08,933 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,942 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:08,942 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:08,943 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:08,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:08,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:17,022 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:23,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 11:43:23,951 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 11:43:23,965 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,197 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-02 11:43:36,197 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-02 11:43:36,204 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,242 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-02 11:43:36,242 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-02 11:43:36,391 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,400 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:36,401 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:36,451 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,594 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume false; [2019-10-02 11:43:36,595 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !false; [2019-10-02 11:43:36,776 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,787 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:36,788 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:36,937 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:36,947 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:36,947 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:36,949 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:47,310 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-10-02 11:43:47,310 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-10-02 11:43:47,320 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:47,359 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-02 11:43:47,359 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-02 11:43:47,369 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:47,400 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-02 11:43:47,401 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-02 11:43:47,420 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:47,430 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:47,430 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:47,681 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:49,963 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-02 11:43:49,963 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L3707: #res := 0; [2019-10-02 11:43:49,964 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-02 11:43:49,964 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:43:49,973 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-02 11:43:49,973 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-02 11:43:52,170 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 11:44:04,294 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-02 11:44:04,295 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-02 11:44:09,138 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:44:09,139 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-02 11:44:09,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:09 BoogieIcfgContainer [2019-10-02 11:44:09,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:44:09,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:44:09,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:44:09,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:44:09,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:42:33" (1/3) ... [2019-10-02 11:44:09,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739299b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:09, skipping insertion in model container [2019-10-02 11:44:09,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:42:35" (2/3) ... [2019-10-02 11:44:09,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739299b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:09, skipping insertion in model container [2019-10-02 11:44:09,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:09" (3/3) ... [2019-10-02 11:44:09,148 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-1.c [2019-10-02 11:44:09,158 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:44:09,167 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:44:09,181 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:44:09,218 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:44:09,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:44:09,219 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:44:09,219 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:44:09,219 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:44:09,220 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:44:09,220 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:44:09,220 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:44:09,220 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:44:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states. [2019-10-02 11:44:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:44:09,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:09,269 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] [2019-10-02 11:44:09,271 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1641690656, now seen corresponding path program 1 times [2019-10-02 11:44:09,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:09,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:09,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:09,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:09,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:09,760 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-02 11:44:09,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:09,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:44:09,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:44:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:44:09,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:44:09,783 INFO L87 Difference]: Start difference. First operand 1253 states. Second operand 2 states. [2019-10-02 11:44:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:09,892 INFO L93 Difference]: Finished difference Result 1348 states and 2091 transitions. [2019-10-02 11:44:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:44:09,893 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2019-10-02 11:44:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:09,914 INFO L225 Difference]: With dead ends: 1348 [2019-10-02 11:44:09,915 INFO L226 Difference]: Without dead ends: 671 [2019-10-02 11:44:09,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02 11:44:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-02 11:44:10,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-10-02 11:44:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-10-02 11:44:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 982 transitions. [2019-10-02 11:44:10,038 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 982 transitions. Word has length 26 [2019-10-02 11:44:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:10,039 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 982 transitions. [2019-10-02 11:44:10,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:44:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 982 transitions. [2019-10-02 11:44:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:44:10,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:10,040 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] [2019-10-02 11:44:10,041 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1487135532, now seen corresponding path program 1 times [2019-10-02 11:44:10,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:10,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:10,192 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-02 11:44:10,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:10,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:10,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:10,195 INFO L87 Difference]: Start difference. First operand 671 states and 982 transitions. Second operand 3 states. [2019-10-02 11:44:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:10,302 INFO L93 Difference]: Finished difference Result 1340 states and 1964 transitions. [2019-10-02 11:44:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:10,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:44:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:10,309 INFO L225 Difference]: With dead ends: 1340 [2019-10-02 11:44:10,309 INFO L226 Difference]: Without dead ends: 677 [2019-10-02 11:44:10,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-10-02 11:44:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 674. [2019-10-02 11:44:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:44:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 985 transitions. [2019-10-02 11:44:10,355 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 985 transitions. Word has length 26 [2019-10-02 11:44:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:10,356 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 985 transitions. [2019-10-02 11:44:10,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 985 transitions. [2019-10-02 11:44:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:44:10,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:10,358 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] [2019-10-02 11:44:10,358 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1488298766, now seen corresponding path program 1 times [2019-10-02 11:44:10,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:10,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:10,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:44:10,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:10,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:10,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:10,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:10,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:10,507 INFO L87 Difference]: Start difference. First operand 674 states and 985 transitions. Second operand 3 states. [2019-10-02 11:44:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:10,690 INFO L93 Difference]: Finished difference Result 693 states and 1010 transitions. [2019-10-02 11:44:10,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:10,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 11:44:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:10,699 INFO L225 Difference]: With dead ends: 693 [2019-10-02 11:44:10,700 INFO L226 Difference]: Without dead ends: 674 [2019-10-02 11:44:10,700 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-02 11:44:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-10-02 11:44:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:44:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 984 transitions. [2019-10-02 11:44:10,748 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 984 transitions. Word has length 32 [2019-10-02 11:44:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:10,749 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 984 transitions. [2019-10-02 11:44:10,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 984 transitions. [2019-10-02 11:44:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:44:10,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:10,757 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] [2019-10-02 11:44:10,758 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1867975053, now seen corresponding path program 1 times [2019-10-02 11:44:10,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:10,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:10,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:10,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:44:10,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:10,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:10,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:10,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:10,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:10,993 INFO L87 Difference]: Start difference. First operand 674 states and 984 transitions. Second operand 3 states. [2019-10-02 11:44:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:11,302 INFO L93 Difference]: Finished difference Result 1257 states and 1815 transitions. [2019-10-02 11:44:11,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:11,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 11:44:11,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:11,313 INFO L225 Difference]: With dead ends: 1257 [2019-10-02 11:44:11,313 INFO L226 Difference]: Without dead ends: 988 [2019-10-02 11:44:11,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-10-02 11:44:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 969. [2019-10-02 11:44:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-02 11:44:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1402 transitions. [2019-10-02 11:44:11,367 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1402 transitions. Word has length 37 [2019-10-02 11:44:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:11,368 INFO L475 AbstractCegarLoop]: Abstraction has 969 states and 1402 transitions. [2019-10-02 11:44:11,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1402 transitions. [2019-10-02 11:44:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:44:11,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:11,373 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] [2019-10-02 11:44:11,374 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:11,374 INFO L82 PathProgramCache]: Analyzing trace with hash 271639672, now seen corresponding path program 1 times [2019-10-02 11:44:11,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:11,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:11,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:11,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:11,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:44:11,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:11,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:11,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:11,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:11,574 INFO L87 Difference]: Start difference. First operand 969 states and 1402 transitions. Second operand 3 states. [2019-10-02 11:44:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:11,864 INFO L93 Difference]: Finished difference Result 2013 states and 2993 transitions. [2019-10-02 11:44:11,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:11,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-02 11:44:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:11,879 INFO L225 Difference]: With dead ends: 2013 [2019-10-02 11:44:11,879 INFO L226 Difference]: Without dead ends: 1582 [2019-10-02 11:44:11,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-10-02 11:44:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1140. [2019-10-02 11:44:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1140 states. [2019-10-02 11:44:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1677 transitions. [2019-10-02 11:44:11,951 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1677 transitions. Word has length 44 [2019-10-02 11:44:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:11,952 INFO L475 AbstractCegarLoop]: Abstraction has 1140 states and 1677 transitions. [2019-10-02 11:44:11,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1677 transitions. [2019-10-02 11:44:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 11:44:11,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:11,954 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] [2019-10-02 11:44:11,955 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash -407356408, now seen corresponding path program 1 times [2019-10-02 11:44:11,956 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:11,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:44:12,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:12,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:12,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:12,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:12,337 INFO L87 Difference]: Start difference. First operand 1140 states and 1677 transitions. Second operand 5 states. [2019-10-02 11:44:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:14,022 INFO L93 Difference]: Finished difference Result 1843 states and 2732 transitions. [2019-10-02 11:44:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:14,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 11:44:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:14,031 INFO L225 Difference]: With dead ends: 1843 [2019-10-02 11:44:14,032 INFO L226 Difference]: Without dead ends: 1155 [2019-10-02 11:44:14,035 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-10-02 11:44:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1134. [2019-10-02 11:44:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-10-02 11:44:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1665 transitions. [2019-10-02 11:44:14,090 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1665 transitions. Word has length 45 [2019-10-02 11:44:14,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:14,091 INFO L475 AbstractCegarLoop]: Abstraction has 1134 states and 1665 transitions. [2019-10-02 11:44:14,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1665 transitions. [2019-10-02 11:44:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:44:14,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:14,093 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] [2019-10-02 11:44:14,093 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2059035920, now seen corresponding path program 1 times [2019-10-02 11:44:14,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:14,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:14,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:44:14,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:14,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:14,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:14,253 INFO L87 Difference]: Start difference. First operand 1134 states and 1665 transitions. Second operand 3 states. [2019-10-02 11:44:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:14,366 INFO L93 Difference]: Finished difference Result 1866 states and 2683 transitions. [2019-10-02 11:44:14,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:14,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 11:44:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:14,387 INFO L225 Difference]: With dead ends: 1866 [2019-10-02 11:44:14,388 INFO L226 Difference]: Without dead ends: 1698 [2019-10-02 11:44:14,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-02 11:44:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1611. [2019-10-02 11:44:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-10-02 11:44:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2357 transitions. [2019-10-02 11:44:14,501 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2357 transitions. Word has length 46 [2019-10-02 11:44:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:14,501 INFO L475 AbstractCegarLoop]: Abstraction has 1611 states and 2357 transitions. [2019-10-02 11:44:14,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2357 transitions. [2019-10-02 11:44:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:44:14,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:14,504 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] [2019-10-02 11:44:14,505 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:14,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1213243744, now seen corresponding path program 1 times [2019-10-02 11:44:14,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:14,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 11:44:14,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:14,670 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:15,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:15,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:44:15,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:15,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:44:15,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 11:44:15,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:15,879 INFO L87 Difference]: Start difference. First operand 1611 states and 2357 transitions. Second operand 5 states. [2019-10-02 11:44:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:16,047 INFO L93 Difference]: Finished difference Result 3222 states and 4716 transitions. [2019-10-02 11:44:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:44:16,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-02 11:44:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:16,060 INFO L225 Difference]: With dead ends: 3222 [2019-10-02 11:44:16,060 INFO L226 Difference]: Without dead ends: 1620 [2019-10-02 11:44:16,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-10-02 11:44:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1617. [2019-10-02 11:44:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-10-02 11:44:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2363 transitions. [2019-10-02 11:44:16,151 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2363 transitions. Word has length 46 [2019-10-02 11:44:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:16,152 INFO L475 AbstractCegarLoop]: Abstraction has 1617 states and 2363 transitions. [2019-10-02 11:44:16,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2363 transitions. [2019-10-02 11:44:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:44:16,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:16,153 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:44:16,154 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:16,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1388742298, now seen corresponding path program 2 times [2019-10-02 11:44:16,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:16,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 11:44:16,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:16,292 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:17,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:44:17,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:44:17,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:44:17,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:17,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 11:44:17,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:17,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-10-02 11:44:17,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:17,604 INFO L87 Difference]: Start difference. First operand 1617 states and 2363 transitions. Second operand 6 states. [2019-10-02 11:44:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:17,982 INFO L93 Difference]: Finished difference Result 3231 states and 4725 transitions. [2019-10-02 11:44:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:44:17,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-02 11:44:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:17,995 INFO L225 Difference]: With dead ends: 3231 [2019-10-02 11:44:17,996 INFO L226 Difference]: Without dead ends: 1625 [2019-10-02 11:44:18,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-10-02 11:44:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1622. [2019-10-02 11:44:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-10-02 11:44:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2366 transitions. [2019-10-02 11:44:18,097 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2366 transitions. Word has length 52 [2019-10-02 11:44:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:18,097 INFO L475 AbstractCegarLoop]: Abstraction has 1622 states and 2366 transitions. [2019-10-02 11:44:18,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2366 transitions. [2019-10-02 11:44:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 11:44:18,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:18,100 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:18,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash 155655718, now seen corresponding path program 1 times [2019-10-02 11:44:18,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:18,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:18,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:44:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:18,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:44:18,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:44:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:44:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:44:18,323 INFO L87 Difference]: Start difference. First operand 1622 states and 2366 transitions. Second operand 4 states. [2019-10-02 11:44:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:18,770 INFO L93 Difference]: Finished difference Result 2417 states and 3468 transitions. [2019-10-02 11:44:18,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:18,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-10-02 11:44:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:18,780 INFO L225 Difference]: With dead ends: 2417 [2019-10-02 11:44:18,780 INFO L226 Difference]: Without dead ends: 1302 [2019-10-02 11:44:18,785 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-02 11:44:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-10-02 11:44:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1211. [2019-10-02 11:44:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2019-10-02 11:44:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1740 transitions. [2019-10-02 11:44:18,847 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1740 transitions. Word has length 70 [2019-10-02 11:44:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:18,847 INFO L475 AbstractCegarLoop]: Abstraction has 1211 states and 1740 transitions. [2019-10-02 11:44:18,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:44:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1740 transitions. [2019-10-02 11:44:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:44:18,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:18,850 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:18,850 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1440878696, now seen corresponding path program 1 times [2019-10-02 11:44:18,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:18,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:18,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:19,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:19,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:19,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:19,158 INFO L87 Difference]: Start difference. First operand 1211 states and 1740 transitions. Second operand 3 states. [2019-10-02 11:44:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:19,206 INFO L93 Difference]: Finished difference Result 1888 states and 2699 transitions. [2019-10-02 11:44:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:19,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 11:44:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:19,214 INFO L225 Difference]: With dead ends: 1888 [2019-10-02 11:44:19,214 INFO L226 Difference]: Without dead ends: 1208 [2019-10-02 11:44:19,216 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-10-02 11:44:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2019-10-02 11:44:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-10-02 11:44:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1729 transitions. [2019-10-02 11:44:19,275 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1729 transitions. Word has length 71 [2019-10-02 11:44:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:19,277 INFO L475 AbstractCegarLoop]: Abstraction has 1208 states and 1729 transitions. [2019-10-02 11:44:19,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1729 transitions. [2019-10-02 11:44:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 11:44:19,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:19,281 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:19,281 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1744315799, now seen corresponding path program 1 times [2019-10-02 11:44:19,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:19,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:19,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:44:19,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:19,535 INFO L87 Difference]: Start difference. First operand 1208 states and 1729 transitions. Second operand 7 states. [2019-10-02 11:44:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:24,065 INFO L93 Difference]: Finished difference Result 1719 states and 2483 transitions. [2019-10-02 11:44:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:44:24,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-02 11:44:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:24,076 INFO L225 Difference]: With dead ends: 1719 [2019-10-02 11:44:24,076 INFO L226 Difference]: Without dead ends: 1659 [2019-10-02 11:44:24,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:44:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-10-02 11:44:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1239. [2019-10-02 11:44:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-10-02 11:44:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1774 transitions. [2019-10-02 11:44:24,161 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1774 transitions. Word has length 71 [2019-10-02 11:44:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:24,162 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1774 transitions. [2019-10-02 11:44:24,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1774 transitions. [2019-10-02 11:44:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:44:24,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:24,170 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:24,170 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:24,171 INFO L82 PathProgramCache]: Analyzing trace with hash -62224846, now seen corresponding path program 1 times [2019-10-02 11:44:24,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:24,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:24,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:24,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:24,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:44:24,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:24,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:24,435 INFO L87 Difference]: Start difference. First operand 1239 states and 1774 transitions. Second operand 6 states. [2019-10-02 11:44:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:25,925 INFO L93 Difference]: Finished difference Result 1578 states and 2252 transitions. [2019-10-02 11:44:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:25,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-02 11:44:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:25,934 INFO L225 Difference]: With dead ends: 1578 [2019-10-02 11:44:25,934 INFO L226 Difference]: Without dead ends: 1566 [2019-10-02 11:44:25,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2019-10-02 11:44:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1293. [2019-10-02 11:44:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2019-10-02 11:44:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1839 transitions. [2019-10-02 11:44:26,008 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1839 transitions. Word has length 73 [2019-10-02 11:44:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:26,008 INFO L475 AbstractCegarLoop]: Abstraction has 1293 states and 1839 transitions. [2019-10-02 11:44:26,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1839 transitions. [2019-10-02 11:44:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:44:26,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:26,012 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:26,012 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash -62501676, now seen corresponding path program 1 times [2019-10-02 11:44:26,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:26,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:26,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:26,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:26,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:26,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:26,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:26,141 INFO L87 Difference]: Start difference. First operand 1293 states and 1839 transitions. Second operand 3 states. [2019-10-02 11:44:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:26,238 INFO L93 Difference]: Finished difference Result 1313 states and 1866 transitions. [2019-10-02 11:44:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:26,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 11:44:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:26,246 INFO L225 Difference]: With dead ends: 1313 [2019-10-02 11:44:26,246 INFO L226 Difference]: Without dead ends: 1287 [2019-10-02 11:44:26,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-10-02 11:44:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1241. [2019-10-02 11:44:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-10-02 11:44:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1773 transitions. [2019-10-02 11:44:26,322 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1773 transitions. Word has length 73 [2019-10-02 11:44:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:26,322 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1773 transitions. [2019-10-02 11:44:26,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1773 transitions. [2019-10-02 11:44:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:44:26,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:26,326 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:26,326 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1770605319, now seen corresponding path program 1 times [2019-10-02 11:44:26,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:26,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:26,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:26,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:26,431 INFO L87 Difference]: Start difference. First operand 1241 states and 1773 transitions. Second operand 3 states. [2019-10-02 11:44:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:26,498 INFO L93 Difference]: Finished difference Result 1276 states and 1814 transitions. [2019-10-02 11:44:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:26,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 11:44:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:26,505 INFO L225 Difference]: With dead ends: 1276 [2019-10-02 11:44:26,506 INFO L226 Difference]: Without dead ends: 1251 [2019-10-02 11:44:26,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-02 11:44:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1244. [2019-10-02 11:44:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-10-02 11:44:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1777 transitions. [2019-10-02 11:44:26,573 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1777 transitions. Word has length 73 [2019-10-02 11:44:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:26,573 INFO L475 AbstractCegarLoop]: Abstraction has 1244 states and 1777 transitions. [2019-10-02 11:44:26,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1777 transitions. [2019-10-02 11:44:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:44:26,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:26,576 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:26,576 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:26,577 INFO L82 PathProgramCache]: Analyzing trace with hash -223539387, now seen corresponding path program 1 times [2019-10-02 11:44:26,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:26,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:26,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:26,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:26,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:44:26,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:26,766 INFO L87 Difference]: Start difference. First operand 1244 states and 1777 transitions. Second operand 7 states. [2019-10-02 11:44:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:30,021 INFO L93 Difference]: Finished difference Result 1408 states and 2030 transitions. [2019-10-02 11:44:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:44:30,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-10-02 11:44:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:30,029 INFO L225 Difference]: With dead ends: 1408 [2019-10-02 11:44:30,029 INFO L226 Difference]: Without dead ends: 1347 [2019-10-02 11:44:30,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-10-02 11:44:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1218. [2019-10-02 11:44:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 11:44:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1739 transitions. [2019-10-02 11:44:30,100 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1739 transitions. Word has length 73 [2019-10-02 11:44:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:30,100 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1739 transitions. [2019-10-02 11:44:30,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1739 transitions. [2019-10-02 11:44:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 11:44:30,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:30,103 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:30,103 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1152192750, now seen corresponding path program 1 times [2019-10-02 11:44:30,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:30,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:30,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:30,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:30,297 INFO L87 Difference]: Start difference. First operand 1218 states and 1739 transitions. Second operand 3 states. [2019-10-02 11:44:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:30,481 INFO L93 Difference]: Finished difference Result 1903 states and 2694 transitions. [2019-10-02 11:44:30,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:30,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-02 11:44:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:30,490 INFO L225 Difference]: With dead ends: 1903 [2019-10-02 11:44:30,490 INFO L226 Difference]: Without dead ends: 1287 [2019-10-02 11:44:30,493 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-10-02 11:44:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1218. [2019-10-02 11:44:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 11:44:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1738 transitions. [2019-10-02 11:44:30,567 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1738 transitions. Word has length 78 [2019-10-02 11:44:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:30,567 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1738 transitions. [2019-10-02 11:44:30,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1738 transitions. [2019-10-02 11:44:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 11:44:30,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:30,570 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:30,570 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:30,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:30,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1930135672, now seen corresponding path program 1 times [2019-10-02 11:44:30,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:30,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:30,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:44:30,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:44:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:44:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:30,772 INFO L87 Difference]: Start difference. First operand 1218 states and 1738 transitions. Second operand 8 states. [2019-10-02 11:44:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:31,413 INFO L93 Difference]: Finished difference Result 1230 states and 1750 transitions. [2019-10-02 11:44:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:31,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-10-02 11:44:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:31,420 INFO L225 Difference]: With dead ends: 1230 [2019-10-02 11:44:31,420 INFO L226 Difference]: Without dead ends: 1195 [2019-10-02 11:44:31,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-10-02 11:44:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2019-10-02 11:44:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2019-10-02 11:44:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1712 transitions. [2019-10-02 11:44:31,492 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1712 transitions. Word has length 74 [2019-10-02 11:44:31,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:31,492 INFO L475 AbstractCegarLoop]: Abstraction has 1195 states and 1712 transitions. [2019-10-02 11:44:31,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:44:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1712 transitions. [2019-10-02 11:44:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 11:44:31,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:31,495 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:31,495 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:31,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1801695136, now seen corresponding path program 1 times [2019-10-02 11:44:31,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:31,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:31,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:31,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:31,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:31,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:31,733 INFO L87 Difference]: Start difference. First operand 1195 states and 1712 transitions. Second operand 3 states. [2019-10-02 11:44:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:31,828 INFO L93 Difference]: Finished difference Result 1283 states and 1818 transitions. [2019-10-02 11:44:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:31,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-02 11:44:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:31,835 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 11:44:31,836 INFO L226 Difference]: Without dead ends: 1203 [2019-10-02 11:44:31,837 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-10-02 11:44:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1184. [2019-10-02 11:44:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-10-02 11:44:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1699 transitions. [2019-10-02 11:44:31,908 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1699 transitions. Word has length 79 [2019-10-02 11:44:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:31,909 INFO L475 AbstractCegarLoop]: Abstraction has 1184 states and 1699 transitions. [2019-10-02 11:44:31,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1699 transitions. [2019-10-02 11:44:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:44:31,913 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:31,914 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:31,914 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:31,914 INFO L82 PathProgramCache]: Analyzing trace with hash 98458172, now seen corresponding path program 1 times [2019-10-02 11:44:31,914 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:31,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:31,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:31,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:32,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:32,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:32,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:32,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:32,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:32,161 INFO L87 Difference]: Start difference. First operand 1184 states and 1699 transitions. Second operand 3 states. [2019-10-02 11:44:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:34,312 INFO L93 Difference]: Finished difference Result 1222 states and 1743 transitions. [2019-10-02 11:44:34,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:34,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-02 11:44:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:34,327 INFO L225 Difference]: With dead ends: 1222 [2019-10-02 11:44:34,328 INFO L226 Difference]: Without dead ends: 1190 [2019-10-02 11:44:34,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-10-02 11:44:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1185. [2019-10-02 11:44:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-10-02 11:44:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1700 transitions. [2019-10-02 11:44:34,404 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1700 transitions. Word has length 82 [2019-10-02 11:44:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:34,405 INFO L475 AbstractCegarLoop]: Abstraction has 1185 states and 1700 transitions. [2019-10-02 11:44:34,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1700 transitions. [2019-10-02 11:44:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:44:34,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:34,408 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:34,409 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:34,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash 239006782, now seen corresponding path program 1 times [2019-10-02 11:44:34,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:34,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:34,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:34,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:34,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:34,549 INFO L87 Difference]: Start difference. First operand 1185 states and 1700 transitions. Second operand 3 states. [2019-10-02 11:44:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:34,721 INFO L93 Difference]: Finished difference Result 1208 states and 1726 transitions. [2019-10-02 11:44:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:34,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-02 11:44:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:34,728 INFO L225 Difference]: With dead ends: 1208 [2019-10-02 11:44:34,728 INFO L226 Difference]: Without dead ends: 1201 [2019-10-02 11:44:34,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-10-02 11:44:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1199. [2019-10-02 11:44:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-10-02 11:44:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1716 transitions. [2019-10-02 11:44:34,814 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1716 transitions. Word has length 82 [2019-10-02 11:44:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:34,814 INFO L475 AbstractCegarLoop]: Abstraction has 1199 states and 1716 transitions. [2019-10-02 11:44:34,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1716 transitions. [2019-10-02 11:44:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:44:34,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:34,824 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:34,824 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1682006880, now seen corresponding path program 1 times [2019-10-02 11:44:34,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:34,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:34,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:35,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:35,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:44:35,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:44:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:44:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:35,115 INFO L87 Difference]: Start difference. First operand 1199 states and 1716 transitions. Second operand 10 states. [2019-10-02 11:44:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:35,903 INFO L93 Difference]: Finished difference Result 1214 states and 1731 transitions. [2019-10-02 11:44:35,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:44:35,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-10-02 11:44:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:35,915 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 11:44:35,915 INFO L226 Difference]: Without dead ends: 1197 [2019-10-02 11:44:35,917 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:44:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-10-02 11:44:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-10-02 11:44:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-10-02 11:44:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1712 transitions. [2019-10-02 11:44:35,982 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1712 transitions. Word has length 83 [2019-10-02 11:44:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:35,982 INFO L475 AbstractCegarLoop]: Abstraction has 1197 states and 1712 transitions. [2019-10-02 11:44:35,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:44:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1712 transitions. [2019-10-02 11:44:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-02 11:44:35,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:35,986 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:35,986 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:35,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1990291710, now seen corresponding path program 1 times [2019-10-02 11:44:35,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:36,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:36,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:36,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:44:36,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:44:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:44:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:36,203 INFO L87 Difference]: Start difference. First operand 1197 states and 1712 transitions. Second operand 10 states. [2019-10-02 11:44:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:36,928 INFO L93 Difference]: Finished difference Result 1209 states and 1724 transitions. [2019-10-02 11:44:36,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:44:36,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-10-02 11:44:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:36,936 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 11:44:36,937 INFO L226 Difference]: Without dead ends: 1192 [2019-10-02 11:44:36,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:44:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-10-02 11:44:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-10-02 11:44:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-02 11:44:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1705 transitions. [2019-10-02 11:44:37,007 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1705 transitions. Word has length 81 [2019-10-02 11:44:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:37,007 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1705 transitions. [2019-10-02 11:44:37,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:44:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1705 transitions. [2019-10-02 11:44:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-02 11:44:37,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:37,013 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:37,013 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1173014062, now seen corresponding path program 1 times [2019-10-02 11:44:37,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:37,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:37,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:37,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:37,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:37,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:37,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:44:37,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:44:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:44:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:37,244 INFO L87 Difference]: Start difference. First operand 1192 states and 1705 transitions. Second operand 5 states. [2019-10-02 11:44:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:38,293 INFO L93 Difference]: Finished difference Result 1199 states and 1710 transitions. [2019-10-02 11:44:38,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:38,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-02 11:44:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:38,300 INFO L225 Difference]: With dead ends: 1199 [2019-10-02 11:44:38,300 INFO L226 Difference]: Without dead ends: 1194 [2019-10-02 11:44:38,301 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-02 11:44:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1192. [2019-10-02 11:44:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-10-02 11:44:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1704 transitions. [2019-10-02 11:44:38,368 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1704 transitions. Word has length 83 [2019-10-02 11:44:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:38,369 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1704 transitions. [2019-10-02 11:44:38,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:44:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1704 transitions. [2019-10-02 11:44:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 11:44:38,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:38,372 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:38,372 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:38,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2014710464, now seen corresponding path program 1 times [2019-10-02 11:44:38,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:38,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:38,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:38,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:44:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:38,535 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:39,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:44:39,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:39,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:44:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 11:44:39,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:39,773 INFO L87 Difference]: Start difference. First operand 1192 states and 1704 transitions. Second operand 7 states. [2019-10-02 11:44:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:40,028 INFO L93 Difference]: Finished difference Result 2380 states and 3406 transitions. [2019-10-02 11:44:40,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:44:40,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-02 11:44:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:40,034 INFO L225 Difference]: With dead ends: 2380 [2019-10-02 11:44:40,034 INFO L226 Difference]: Without dead ends: 1201 [2019-10-02 11:44:40,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-10-02 11:44:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1198. [2019-10-02 11:44:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-10-02 11:44:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1710 transitions. [2019-10-02 11:44:40,103 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1710 transitions. Word has length 84 [2019-10-02 11:44:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:40,103 INFO L475 AbstractCegarLoop]: Abstraction has 1198 states and 1710 transitions. [2019-10-02 11:44:40,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1710 transitions. [2019-10-02 11:44:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:44:40,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:40,106 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:40,106 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:40,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 435970310, now seen corresponding path program 2 times [2019-10-02 11:44:40,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:40,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:44:40,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:40,264 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:41,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:44:41,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:44:41,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:44:41,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:44:41,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:41,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:44:41,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:44:41,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:44:41,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:41,496 INFO L87 Difference]: Start difference. First operand 1198 states and 1710 transitions. Second operand 9 states. [2019-10-02 11:44:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:41,759 INFO L93 Difference]: Finished difference Result 2408 states and 3469 transitions. [2019-10-02 11:44:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:44:41,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-10-02 11:44:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:41,765 INFO L225 Difference]: With dead ends: 2408 [2019-10-02 11:44:41,765 INFO L226 Difference]: Without dead ends: 1217 [2019-10-02 11:44:41,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-10-02 11:44:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1214. [2019-10-02 11:44:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-10-02 11:44:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1728 transitions. [2019-10-02 11:44:41,833 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1728 transitions. Word has length 90 [2019-10-02 11:44:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:41,834 INFO L475 AbstractCegarLoop]: Abstraction has 1214 states and 1728 transitions. [2019-10-02 11:44:41,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:44:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1728 transitions. [2019-10-02 11:44:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:44:41,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:41,838 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:41,838 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash 258067984, now seen corresponding path program 1 times [2019-10-02 11:44:41,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:41,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:44:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 11:44:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:42,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:44:42,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:42,126 INFO L87 Difference]: Start difference. First operand 1214 states and 1728 transitions. Second operand 6 states. [2019-10-02 11:44:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:43,084 INFO L93 Difference]: Finished difference Result 2419 states and 3453 transitions. [2019-10-02 11:44:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:43,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-02 11:44:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:43,094 INFO L225 Difference]: With dead ends: 2419 [2019-10-02 11:44:43,095 INFO L226 Difference]: Without dead ends: 2338 [2019-10-02 11:44:43,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-10-02 11:44:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2215. [2019-10-02 11:44:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2215 states. [2019-10-02 11:44:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3191 transitions. [2019-10-02 11:44:43,231 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3191 transitions. Word has length 98 [2019-10-02 11:44:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:43,232 INFO L475 AbstractCegarLoop]: Abstraction has 2215 states and 3191 transitions. [2019-10-02 11:44:43,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3191 transitions. [2019-10-02 11:44:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:44:43,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:43,237 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:43,238 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 919749023, now seen corresponding path program 1 times [2019-10-02 11:44:43,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:43,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:43,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 11:44:43,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:43,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:44:43,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:44:43,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:44:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:43,403 INFO L87 Difference]: Start difference. First operand 2215 states and 3191 transitions. Second operand 3 states. [2019-10-02 11:44:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:43,602 INFO L93 Difference]: Finished difference Result 3239 states and 4657 transitions. [2019-10-02 11:44:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:44:43,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-02 11:44:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:43,612 INFO L225 Difference]: With dead ends: 3239 [2019-10-02 11:44:43,613 INFO L226 Difference]: Without dead ends: 2207 [2019-10-02 11:44:43,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:44:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-10-02 11:44:43,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 2207. [2019-10-02 11:44:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-10-02 11:44:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3177 transitions. [2019-10-02 11:44:43,747 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3177 transitions. Word has length 100 [2019-10-02 11:44:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:43,748 INFO L475 AbstractCegarLoop]: Abstraction has 2207 states and 3177 transitions. [2019-10-02 11:44:43,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:44:43,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3177 transitions. [2019-10-02 11:44:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:44:43,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:43,754 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:43,754 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 703711126, now seen corresponding path program 1 times [2019-10-02 11:44:43,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:43,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:43,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:44:43,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:43,945 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:45,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:45,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:44:45,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:44:45,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 11:44:45,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:44:45,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:44:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:45,303 INFO L87 Difference]: Start difference. First operand 2207 states and 3177 transitions. Second operand 9 states. [2019-10-02 11:44:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:45,510 INFO L93 Difference]: Finished difference Result 4406 states and 6348 transitions. [2019-10-02 11:44:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:45,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-10-02 11:44:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:45,519 INFO L225 Difference]: With dead ends: 4406 [2019-10-02 11:44:45,519 INFO L226 Difference]: Without dead ends: 2216 [2019-10-02 11:44:45,526 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-10-02 11:44:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2213. [2019-10-02 11:44:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-10-02 11:44:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3183 transitions. [2019-10-02 11:44:45,658 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3183 transitions. Word has length 97 [2019-10-02 11:44:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:45,658 INFO L475 AbstractCegarLoop]: Abstraction has 2213 states and 3183 transitions. [2019-10-02 11:44:45,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:44:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3183 transitions. [2019-10-02 11:44:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 11:44:45,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:45,664 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:45,664 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash 99557198, now seen corresponding path program 1 times [2019-10-02 11:44:45,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:45,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:45,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:45,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:45,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 11:44:45,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:45,858 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:44:47,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 11:44:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:44:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 11:44:47,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:44:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:44:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:47,123 INFO L87 Difference]: Start difference. First operand 2213 states and 3183 transitions. Second operand 10 states. [2019-10-02 11:44:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:47,366 INFO L93 Difference]: Finished difference Result 4416 states and 6358 transitions. [2019-10-02 11:44:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:44:47,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-10-02 11:44:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:47,375 INFO L225 Difference]: With dead ends: 4416 [2019-10-02 11:44:47,375 INFO L226 Difference]: Without dead ends: 2222 [2019-10-02 11:44:47,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-10-02 11:44:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2219. [2019-10-02 11:44:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2019-10-02 11:44:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3189 transitions. [2019-10-02 11:44:47,505 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3189 transitions. Word has length 103 [2019-10-02 11:44:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:47,505 INFO L475 AbstractCegarLoop]: Abstraction has 2219 states and 3189 transitions. [2019-10-02 11:44:47,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:44:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3189 transitions. [2019-10-02 11:44:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 11:44:47,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:47,511 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:44:47,511 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash -145908982, now seen corresponding path program 2 times [2019-10-02 11:44:47,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:47,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:47,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 11:44:47,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:47,725 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:48,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:45:01,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:45:01,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:45:01,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-10-02 11:45:01,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:45:01,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-10-02 11:45:01,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:45:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:45:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:45:01,169 INFO L87 Difference]: Start difference. First operand 2219 states and 3189 transitions. Second operand 13 states. [2019-10-02 11:45:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:01,571 INFO L93 Difference]: Finished difference Result 4462 states and 6474 transitions. [2019-10-02 11:45:01,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:45:01,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-10-02 11:45:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:01,581 INFO L225 Difference]: With dead ends: 4462 [2019-10-02 11:45:01,581 INFO L226 Difference]: Without dead ends: 2248 [2019-10-02 11:45:01,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:45:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-10-02 11:45:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2237. [2019-10-02 11:45:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-10-02 11:45:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3211 transitions. [2019-10-02 11:45:01,743 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3211 transitions. Word has length 109 [2019-10-02 11:45:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:01,744 INFO L475 AbstractCegarLoop]: Abstraction has 2237 states and 3211 transitions. [2019-10-02 11:45:01,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:45:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3211 transitions. [2019-10-02 11:45:01,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 11:45:01,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:01,750 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:45:01,750 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:01,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash -469233061, now seen corresponding path program 1 times [2019-10-02 11:45:01,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:01,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:01,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:45:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 11:45:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:01,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:45:01,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:45:01,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:45:01,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:45:01,959 INFO L87 Difference]: Start difference. First operand 2237 states and 3211 transitions. Second operand 11 states. [2019-10-02 11:45:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:02,933 INFO L93 Difference]: Finished difference Result 2256 states and 3230 transitions. [2019-10-02 11:45:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:45:02,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 114 [2019-10-02 11:45:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:02,944 INFO L225 Difference]: With dead ends: 2256 [2019-10-02 11:45:02,944 INFO L226 Difference]: Without dead ends: 2231 [2019-10-02 11:45:02,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:45:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-10-02 11:45:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2019-10-02 11:45:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-10-02 11:45:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3201 transitions. [2019-10-02 11:45:03,081 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3201 transitions. Word has length 114 [2019-10-02 11:45:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:03,081 INFO L475 AbstractCegarLoop]: Abstraction has 2231 states and 3201 transitions. [2019-10-02 11:45:03,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:45:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3201 transitions. [2019-10-02 11:45:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 11:45:03,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:03,089 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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] [2019-10-02 11:45:03,089 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1256031584, now seen corresponding path program 2 times [2019-10-02 11:45:03,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:03,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:03,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:03,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 11:45:03,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:03,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:04,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:45:07,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:45:07,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:45:07,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:45:07,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 11:45:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:45:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 11:45:07,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:45:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:45:07,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:07,553 INFO L87 Difference]: Start difference. First operand 2231 states and 3201 transitions. Second operand 12 states. [2019-10-02 11:45:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:07,785 INFO L93 Difference]: Finished difference Result 4448 states and 6390 transitions. [2019-10-02 11:45:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:45:07,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-10-02 11:45:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:07,800 INFO L225 Difference]: With dead ends: 4448 [2019-10-02 11:45:07,800 INFO L226 Difference]: Without dead ends: 2240 [2019-10-02 11:45:07,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-10-02 11:45:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2237. [2019-10-02 11:45:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-10-02 11:45:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3207 transitions. [2019-10-02 11:45:07,948 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3207 transitions. Word has length 116 [2019-10-02 11:45:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:07,949 INFO L475 AbstractCegarLoop]: Abstraction has 2237 states and 3207 transitions. [2019-10-02 11:45:07,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:45:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3207 transitions. [2019-10-02 11:45:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 11:45:08,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:08,082 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 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] [2019-10-02 11:45:08,082 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash 536365092, now seen corresponding path program 3 times [2019-10-02 11:45:08,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:45:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-10-02 11:45:08,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:08,434 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:09,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:45:21,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 11:45:21,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:45:21,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:45:21,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-10-02 11:45:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:45:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2019-10-02 11:45:21,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:45:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:45:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:45:21,841 INFO L87 Difference]: Start difference. First operand 2237 states and 3207 transitions. Second operand 16 states. [2019-10-02 11:45:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:22,338 INFO L93 Difference]: Finished difference Result 4502 states and 6514 transitions. [2019-10-02 11:45:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:45:22,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 122 [2019-10-02 11:45:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:22,347 INFO L225 Difference]: With dead ends: 4502 [2019-10-02 11:45:22,347 INFO L226 Difference]: Without dead ends: 2274 [2019-10-02 11:45:22,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:45:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2019-10-02 11:45:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2255. [2019-10-02 11:45:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-10-02 11:45:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3229 transitions. [2019-10-02 11:45:22,499 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3229 transitions. Word has length 122 [2019-10-02 11:45:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:22,500 INFO L475 AbstractCegarLoop]: Abstraction has 2255 states and 3229 transitions. [2019-10-02 11:45:22,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:45:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3229 transitions. [2019-10-02 11:45:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 11:45:22,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:22,506 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:22,506 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1478288328, now seen corresponding path program 4 times [2019-10-02 11:45:22,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:22,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:22,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:22,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:45:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 11:45:22,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:22,880 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:23,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:45:24,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:45:24,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:45:24,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:45:24,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-02 11:45:24,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:45:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-02 11:45:24,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:45:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:45:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:24,155 INFO L87 Difference]: Start difference. First operand 2255 states and 3229 transitions. Second operand 14 states. [2019-10-02 11:45:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:24,591 INFO L93 Difference]: Finished difference Result 4492 states and 6442 transitions. [2019-10-02 11:45:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:45:24,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-10-02 11:45:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:24,601 INFO L225 Difference]: With dead ends: 4492 [2019-10-02 11:45:24,601 INFO L226 Difference]: Without dead ends: 2264 [2019-10-02 11:45:24,608 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:45:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2019-10-02 11:45:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2261. [2019-10-02 11:45:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-10-02 11:45:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3235 transitions. [2019-10-02 11:45:24,781 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3235 transitions. Word has length 129 [2019-10-02 11:45:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:24,781 INFO L475 AbstractCegarLoop]: Abstraction has 2261 states and 3235 transitions. [2019-10-02 11:45:24,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:45:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3235 transitions. [2019-10-02 11:45:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 11:45:24,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:24,787 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:24,787 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash 429175920, now seen corresponding path program 3 times [2019-10-02 11:45:24,788 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:24,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:24,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:45:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-02 11:45:25,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:25,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:45:50,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-02 11:45:50,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:45:50,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:45:50,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-02 11:45:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:45:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-10-02 11:45:50,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:45:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:45:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:45:50,601 INFO L87 Difference]: Start difference. First operand 2261 states and 3235 transitions. Second operand 20 states. [2019-10-02 11:45:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:52,002 INFO L93 Difference]: Finished difference Result 4554 states and 6574 transitions. [2019-10-02 11:45:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:45:52,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 135 [2019-10-02 11:45:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:52,010 INFO L225 Difference]: With dead ends: 4554 [2019-10-02 11:45:52,010 INFO L226 Difference]: Without dead ends: 2306 [2019-10-02 11:45:52,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:45:52,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2019-10-02 11:45:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2279. [2019-10-02 11:45:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2019-10-02 11:45:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3257 transitions. [2019-10-02 11:45:52,172 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3257 transitions. Word has length 135 [2019-10-02 11:45:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:52,172 INFO L475 AbstractCegarLoop]: Abstraction has 2279 states and 3257 transitions. [2019-10-02 11:45:52,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:45:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3257 transitions. [2019-10-02 11:45:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 11:45:52,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:52,181 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:45:52,181 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 53571254, now seen corresponding path program 5 times [2019-10-02 11:45:52,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:52,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:52,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:45:52,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-10-02 11:45:52,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:52,544 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:53,473 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:47:23,536 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-02 11:47:23,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:47:23,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:47:23,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:47:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-10-02 11:47:23,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:47:23,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-02 11:47:23,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:47:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:47:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:47:23,675 INFO L87 Difference]: Start difference. First operand 2279 states and 3257 transitions. Second operand 16 states. [2019-10-02 11:47:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:24,072 INFO L93 Difference]: Finished difference Result 4536 states and 6494 transitions. [2019-10-02 11:47:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:47:24,073 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 142 [2019-10-02 11:47:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:24,078 INFO L225 Difference]: With dead ends: 4536 [2019-10-02 11:47:24,078 INFO L226 Difference]: Without dead ends: 2288 [2019-10-02 11:47:24,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:47:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2019-10-02 11:47:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2285. [2019-10-02 11:47:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-10-02 11:47:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3263 transitions. [2019-10-02 11:47:24,221 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3263 transitions. Word has length 142 [2019-10-02 11:47:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 2285 states and 3263 transitions. [2019-10-02 11:47:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:47:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3263 transitions. [2019-10-02 11:47:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 11:47:24,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:24,227 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:47:24,227 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1684137086, now seen corresponding path program 4 times [2019-10-02 11:47:24,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:24,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:24,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:47:24,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-02 11:47:24,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:47:24,608 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:47:25,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:47:25,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:47:25,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:47:25,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:47:25,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:47:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-02 11:47:26,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:47:26,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-02 11:47:26,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:47:26,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:47:26,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:47:26,043 INFO L87 Difference]: Start difference. First operand 2285 states and 3263 transitions. Second operand 17 states. [2019-10-02 11:47:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:26,390 INFO L93 Difference]: Finished difference Result 4546 states and 6504 transitions. [2019-10-02 11:47:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:47:26,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2019-10-02 11:47:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:26,397 INFO L225 Difference]: With dead ends: 4546 [2019-10-02 11:47:26,397 INFO L226 Difference]: Without dead ends: 2294 [2019-10-02 11:47:26,404 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:47:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-10-02 11:47:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2291. [2019-10-02 11:47:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-10-02 11:47:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3269 transitions. [2019-10-02 11:47:26,537 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3269 transitions. Word has length 148 [2019-10-02 11:47:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:26,537 INFO L475 AbstractCegarLoop]: Abstraction has 2291 states and 3269 transitions. [2019-10-02 11:47:26,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:47:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3269 transitions. [2019-10-02 11:47:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 11:47:26,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:26,543 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:47:26,543 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1533703484, now seen corresponding path program 5 times [2019-10-02 11:47:26,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:26,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:26,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:47:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-10-02 11:47:26,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:47:26,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:47:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:49:31,661 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-02 11:49:31,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:49:31,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1570 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:49:31,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:49:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-10-02 11:49:31,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:49:31,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-02 11:49:31,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:49:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:49:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:49:31,791 INFO L87 Difference]: Start difference. First operand 2291 states and 3269 transitions. Second operand 18 states. [2019-10-02 11:49:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:49:32,192 INFO L93 Difference]: Finished difference Result 4556 states and 6514 transitions. [2019-10-02 11:49:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:49:32,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 154 [2019-10-02 11:49:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:49:32,198 INFO L225 Difference]: With dead ends: 4556 [2019-10-02 11:49:32,198 INFO L226 Difference]: Without dead ends: 2300 [2019-10-02 11:49:32,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:49:32,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2019-10-02 11:49:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2297. [2019-10-02 11:49:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-10-02 11:49:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3275 transitions. [2019-10-02 11:49:32,331 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3275 transitions. Word has length 154 [2019-10-02 11:49:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:32,331 INFO L475 AbstractCegarLoop]: Abstraction has 2297 states and 3275 transitions. [2019-10-02 11:49:32,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:49:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3275 transitions. [2019-10-02 11:49:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 11:49:32,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:32,337 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:49:32,337 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -606617208, now seen corresponding path program 6 times [2019-10-02 11:49:32,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:32,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:32,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:49:32,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-10-02 11:49:32,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:49:32,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:49:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:50:22,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 11:50:22,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:50:22,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:50:22,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:50:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-02 11:50:22,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:50:22,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-02 11:50:22,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:50:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:50:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:50:22,370 INFO L87 Difference]: Start difference. First operand 2297 states and 3275 transitions. Second operand 24 states. [2019-10-02 11:50:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:23,003 INFO L93 Difference]: Finished difference Result 4626 states and 6654 transitions. [2019-10-02 11:50:23,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 11:50:23,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 160 [2019-10-02 11:50:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:23,009 INFO L225 Difference]: With dead ends: 4626 [2019-10-02 11:50:23,009 INFO L226 Difference]: Without dead ends: 2350 [2019-10-02 11:50:23,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2019-10-02 11:50:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2019-10-02 11:50:23,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2315. [2019-10-02 11:50:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2019-10-02 11:50:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3297 transitions. [2019-10-02 11:50:23,121 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3297 transitions. Word has length 160 [2019-10-02 11:50:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:23,122 INFO L475 AbstractCegarLoop]: Abstraction has 2315 states and 3297 transitions. [2019-10-02 11:50:23,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:50:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3297 transitions. [2019-10-02 11:50:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:50:23,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:23,127 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:50:23,127 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash -50180133, now seen corresponding path program 1 times [2019-10-02 11:50:23,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:23,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:23,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:50:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-10-02 11:50:23,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:50:23,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:50:23,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:50:23,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:50:23,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:50:23,489 INFO L87 Difference]: Start difference. First operand 2315 states and 3297 transitions. Second operand 13 states. [2019-10-02 11:50:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:24,825 INFO L93 Difference]: Finished difference Result 2334 states and 3316 transitions. [2019-10-02 11:50:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:50:24,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 166 [2019-10-02 11:50:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:24,832 INFO L225 Difference]: With dead ends: 2334 [2019-10-02 11:50:24,833 INFO L226 Difference]: Without dead ends: 2305 [2019-10-02 11:50:24,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:50:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-10-02 11:50:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-10-02 11:50:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-10-02 11:50:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 3283 transitions. [2019-10-02 11:50:24,966 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 3283 transitions. Word has length 166 [2019-10-02 11:50:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:50:24,966 INFO L475 AbstractCegarLoop]: Abstraction has 2305 states and 3283 transitions. [2019-10-02 11:50:24,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:50:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 3283 transitions. [2019-10-02 11:50:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:50:24,972 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:50:24,972 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:50:24,972 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:50:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:50:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1186643694, now seen corresponding path program 6 times [2019-10-02 11:50:24,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:50:24,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:50:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:50:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:50:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:50:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2019-10-02 11:50:25,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:50:25,383 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:50:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:51:38,777 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 11:51:38,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:51:38,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:51:38,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:51:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-10-02 11:51:39,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:51:39,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 27 [2019-10-02 11:51:39,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-02 11:51:39,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-02 11:51:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:51:39,016 INFO L87 Difference]: Start difference. First operand 2305 states and 3283 transitions. Second operand 27 states. [2019-10-02 11:51:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:41,079 INFO L93 Difference]: Finished difference Result 4648 states and 6676 transitions. [2019-10-02 11:51:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 11:51:41,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 167 [2019-10-02 11:51:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:41,084 INFO L225 Difference]: With dead ends: 4648 [2019-10-02 11:51:41,085 INFO L226 Difference]: Without dead ends: 2366 [2019-10-02 11:51:41,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:51:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2019-10-02 11:51:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2323. [2019-10-02 11:51:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-10-02 11:51:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3305 transitions. [2019-10-02 11:51:41,193 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3305 transitions. Word has length 167 [2019-10-02 11:51:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:41,194 INFO L475 AbstractCegarLoop]: Abstraction has 2323 states and 3305 transitions. [2019-10-02 11:51:41,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-02 11:51:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3305 transitions. [2019-10-02 11:51:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:51:41,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:41,199 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:51:41,199 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:41,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1862166729, now seen corresponding path program 1 times [2019-10-02 11:51:41,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:41,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:41,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:51:41,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-02 11:51:41,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:41,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:51:41,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:51:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:51:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:51:41,416 INFO L87 Difference]: Start difference. First operand 2323 states and 3305 transitions. Second operand 4 states. [2019-10-02 11:51:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:42,087 INFO L93 Difference]: Finished difference Result 2395 states and 3385 transitions. [2019-10-02 11:51:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:51:42,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 11:51:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:42,096 INFO L225 Difference]: With dead ends: 2395 [2019-10-02 11:51:42,096 INFO L226 Difference]: Without dead ends: 2340 [2019-10-02 11:51:42,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:51:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2019-10-02 11:51:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2323. [2019-10-02 11:51:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-10-02 11:51:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3303 transitions. [2019-10-02 11:51:42,228 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3303 transitions. Word has length 173 [2019-10-02 11:51:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:42,229 INFO L475 AbstractCegarLoop]: Abstraction has 2323 states and 3303 transitions. [2019-10-02 11:51:42,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:51:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3303 transitions. [2019-10-02 11:51:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:51:42,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:42,234 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:51:42,234 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:42,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1507249842, now seen corresponding path program 1 times [2019-10-02 11:51:42,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:42,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:42,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:42,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-02 11:51:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:51:42,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:51:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:51:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:51:42,584 INFO L87 Difference]: Start difference. First operand 2323 states and 3303 transitions. Second operand 13 states. [2019-10-02 11:51:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:43,679 INFO L93 Difference]: Finished difference Result 2342 states and 3322 transitions. [2019-10-02 11:51:43,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:51:43,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-10-02 11:51:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:43,689 INFO L225 Difference]: With dead ends: 2342 [2019-10-02 11:51:43,689 INFO L226 Difference]: Without dead ends: 2313 [2019-10-02 11:51:43,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:51:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2019-10-02 11:51:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2313. [2019-10-02 11:51:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-10-02 11:51:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3289 transitions. [2019-10-02 11:51:43,781 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3289 transitions. Word has length 173 [2019-10-02 11:51:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:43,782 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3289 transitions. [2019-10-02 11:51:43,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:51:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3289 transitions. [2019-10-02 11:51:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 11:51:43,785 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:43,785 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 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] [2019-10-02 11:51:43,785 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash -123578670, now seen corresponding path program 1 times [2019-10-02 11:51:43,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-02 11:51:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:51:44,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:51:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:51:44,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:44,011 INFO L87 Difference]: Start difference. First operand 2313 states and 3289 transitions. Second operand 5 states. [2019-10-02 11:51:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:51,822 INFO L93 Difference]: Finished difference Result 3527 states and 4960 transitions. [2019-10-02 11:51:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:51:51,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-10-02 11:51:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:51,829 INFO L225 Difference]: With dead ends: 3527 [2019-10-02 11:51:51,830 INFO L226 Difference]: Without dead ends: 2283 [2019-10-02 11:51:51,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:51:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-10-02 11:51:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2283. [2019-10-02 11:51:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2283 states. [2019-10-02 11:51:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3181 transitions. [2019-10-02 11:51:51,951 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3181 transitions. Word has length 188 [2019-10-02 11:51:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:51,951 INFO L475 AbstractCegarLoop]: Abstraction has 2283 states and 3181 transitions. [2019-10-02 11:51:51,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:51:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3181 transitions. [2019-10-02 11:51:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 11:51:51,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:51,955 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 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] [2019-10-02 11:51:51,955 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1945759973, now seen corresponding path program 1 times [2019-10-02 11:51:51,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:51,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:51,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:51,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-10-02 11:51:52,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:52,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:51:52,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:51:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:51:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:51:52,252 INFO L87 Difference]: Start difference. First operand 2283 states and 3181 transitions. Second operand 5 states. [2019-10-02 11:51:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:53,642 INFO L93 Difference]: Finished difference Result 3788 states and 5307 transitions. [2019-10-02 11:51:53,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:51:53,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-10-02 11:51:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:53,650 INFO L225 Difference]: With dead ends: 3788 [2019-10-02 11:51:53,650 INFO L226 Difference]: Without dead ends: 2855 [2019-10-02 11:51:53,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:51:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2019-10-02 11:51:53,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2425. [2019-10-02 11:51:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2425 states. [2019-10-02 11:51:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 2425 states and 3355 transitions. [2019-10-02 11:51:53,757 INFO L78 Accepts]: Start accepts. Automaton has 2425 states and 3355 transitions. Word has length 189 [2019-10-02 11:51:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:53,757 INFO L475 AbstractCegarLoop]: Abstraction has 2425 states and 3355 transitions. [2019-10-02 11:51:53,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:51:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 3355 transitions. [2019-10-02 11:51:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:51:53,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:53,762 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:51:53,762 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1569620310, now seen corresponding path program 7 times [2019-10-02 11:51:53,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-10-02 11:51:54,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:51:54,326 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:51:55,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:55,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 11:51:55,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:51:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-10-02 11:51:55,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:51:55,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-02 11:51:55,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:51:55,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:51:55,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:51:55,690 INFO L87 Difference]: Start difference. First operand 2425 states and 3355 transitions. Second operand 21 states. [2019-10-02 11:51:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:56,094 INFO L93 Difference]: Finished difference Result 4818 states and 6680 transitions. [2019-10-02 11:51:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:51:56,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 174 [2019-10-02 11:51:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:56,100 INFO L225 Difference]: With dead ends: 4818 [2019-10-02 11:51:56,100 INFO L226 Difference]: Without dead ends: 2434 [2019-10-02 11:51:56,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:51:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2019-10-02 11:51:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2431. [2019-10-02 11:51:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2431 states. [2019-10-02 11:51:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 3361 transitions. [2019-10-02 11:51:56,205 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 3361 transitions. Word has length 174 [2019-10-02 11:51:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:56,205 INFO L475 AbstractCegarLoop]: Abstraction has 2431 states and 3361 transitions. [2019-10-02 11:51:56,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:51:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3361 transitions. [2019-10-02 11:51:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 11:51:56,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:56,209 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:51:56,210 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:56,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 671191450, now seen corresponding path program 7 times [2019-10-02 11:51:56,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:56,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:56,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2019-10-02 11:51:56,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:51:56,657 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:51:57,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:58,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 11:51:58,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:51:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2019-10-02 11:51:58,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:51:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-02 11:51:58,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 11:51:58,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 11:51:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:51:58,187 INFO L87 Difference]: Start difference. First operand 2431 states and 3361 transitions. Second operand 22 states. [2019-10-02 11:51:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:58,641 INFO L93 Difference]: Finished difference Result 4828 states and 6690 transitions. [2019-10-02 11:51:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:51:58,641 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 180 [2019-10-02 11:51:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:58,647 INFO L225 Difference]: With dead ends: 4828 [2019-10-02 11:51:58,647 INFO L226 Difference]: Without dead ends: 2440 [2019-10-02 11:51:58,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:51:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2019-10-02 11:51:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2437. [2019-10-02 11:51:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-10-02 11:51:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3367 transitions. [2019-10-02 11:51:58,774 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3367 transitions. Word has length 180 [2019-10-02 11:51:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:58,775 INFO L475 AbstractCegarLoop]: Abstraction has 2437 states and 3367 transitions. [2019-10-02 11:51:58,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 11:51:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3367 transitions. [2019-10-02 11:51:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 11:51:58,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:58,778 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:51:58,778 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1475338208, now seen corresponding path program 8 times [2019-10-02 11:51:58,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:58,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:58,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:58,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-10-02 11:51:59,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:51:59,257 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:52:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:52:12,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:52:12,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:52:12,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1708 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-02 11:52:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-10-02 11:52:12,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:52:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-02 11:52:12,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 11:52:12,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 11:52:12,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:52:12,625 INFO L87 Difference]: Start difference. First operand 2437 states and 3367 transitions. Second operand 23 states. [2019-10-02 11:52:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:13,070 INFO L93 Difference]: Finished difference Result 4838 states and 6700 transitions. [2019-10-02 11:52:13,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 11:52:13,070 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 186 [2019-10-02 11:52:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:13,075 INFO L225 Difference]: With dead ends: 4838 [2019-10-02 11:52:13,075 INFO L226 Difference]: Without dead ends: 2446 [2019-10-02 11:52:13,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:52:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2019-10-02 11:52:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2443. [2019-10-02 11:52:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2019-10-02 11:52:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3373 transitions. [2019-10-02 11:52:13,239 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3373 transitions. Word has length 186 [2019-10-02 11:52:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:13,239 INFO L475 AbstractCegarLoop]: Abstraction has 2443 states and 3373 transitions. [2019-10-02 11:52:13,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 11:52:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3373 transitions. [2019-10-02 11:52:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:52:13,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:13,242 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:52:13,243 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash -773534680, now seen corresponding path program 8 times [2019-10-02 11:52:13,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:52:13,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2019-10-02 11:52:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:13,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:52:14,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:52:18,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:52:18,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:52:18,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1726 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:52:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2019-10-02 11:52:18,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:52:18,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-02 11:52:18,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:52:18,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:52:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:52:18,412 INFO L87 Difference]: Start difference. First operand 2443 states and 3373 transitions. Second operand 24 states. [2019-10-02 11:52:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:18,895 INFO L93 Difference]: Finished difference Result 4848 states and 6710 transitions. [2019-10-02 11:52:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:52:18,895 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 192 [2019-10-02 11:52:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:18,902 INFO L225 Difference]: With dead ends: 4848 [2019-10-02 11:52:18,902 INFO L226 Difference]: Without dead ends: 2452 [2019-10-02 11:52:18,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-02 11:52:18,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2019-10-02 11:52:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2449. [2019-10-02 11:52:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2449 states. [2019-10-02 11:52:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3379 transitions. [2019-10-02 11:52:19,016 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3379 transitions. Word has length 192 [2019-10-02 11:52:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:19,016 INFO L475 AbstractCegarLoop]: Abstraction has 2449 states and 3379 transitions. [2019-10-02 11:52:19,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:52:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3379 transitions. [2019-10-02 11:52:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 11:52:19,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:19,019 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:52:19,019 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:19,019 INFO L82 PathProgramCache]: Analyzing trace with hash 17981806, now seen corresponding path program 9 times [2019-10-02 11:52:19,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:19,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:52:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-10-02 11:52:19,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:52:19,654 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:52:20,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:52:56,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 11:52:56,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:52:56,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:52:56,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:52:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-10-02 11:52:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:52:57,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11] total 33 [2019-10-02 11:52:57,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 11:52:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 11:52:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 11:52:57,298 INFO L87 Difference]: Start difference. First operand 2449 states and 3379 transitions. Second operand 33 states. [2019-10-02 11:52:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:52:59,312 INFO L93 Difference]: Finished difference Result 4940 states and 6876 transitions. [2019-10-02 11:52:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:52:59,312 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 198 [2019-10-02 11:52:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:52:59,317 INFO L225 Difference]: With dead ends: 4940 [2019-10-02 11:52:59,317 INFO L226 Difference]: Without dead ends: 2520 [2019-10-02 11:52:59,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:52:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-10-02 11:52:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2469. [2019-10-02 11:52:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2469 states. [2019-10-02 11:52:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3403 transitions. [2019-10-02 11:52:59,436 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3403 transitions. Word has length 198 [2019-10-02 11:52:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:59,437 INFO L475 AbstractCegarLoop]: Abstraction has 2469 states and 3403 transitions. [2019-10-02 11:52:59,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 11:52:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3403 transitions. [2019-10-02 11:52:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 11:52:59,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:59,440 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:52:59,440 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886830, now seen corresponding path program 10 times [2019-10-02 11:52:59,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:59,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:59,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:52:59,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-10-02 11:53:00,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:00,362 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:53:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:53:01,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:53:01,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:53:01,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:53:01,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:53:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-10-02 11:53:01,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:53:01,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-02 11:53:01,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:53:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:53:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:53:01,743 INFO L87 Difference]: Start difference. First operand 2469 states and 3403 transitions. Second operand 26 states. [2019-10-02 11:53:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:02,243 INFO L93 Difference]: Finished difference Result 4896 states and 6766 transitions. [2019-10-02 11:53:02,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:53:02,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 205 [2019-10-02 11:53:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:02,249 INFO L225 Difference]: With dead ends: 4896 [2019-10-02 11:53:02,249 INFO L226 Difference]: Without dead ends: 2478 [2019-10-02 11:53:02,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:53:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-02 11:53:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2475. [2019-10-02 11:53:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-10-02 11:53:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3409 transitions. [2019-10-02 11:53:02,364 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3409 transitions. Word has length 205 [2019-10-02 11:53:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:53:02,364 INFO L475 AbstractCegarLoop]: Abstraction has 2475 states and 3409 transitions. [2019-10-02 11:53:02,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 11:53:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3409 transitions. [2019-10-02 11:53:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 11:53:02,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:53:02,367 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 11:53:02,367 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:53:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:53:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash 725148072, now seen corresponding path program 11 times [2019-10-02 11:53:02,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:53:02,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:53:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:02,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:53:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:53:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:53:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2019-10-02 11:53:03,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:53:03,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:53:04,133 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1