/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:27:25,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:27:25,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:27:25,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:27:25,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:27:25,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:27:25,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:27:25,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:27:25,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:27:25,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:27:25,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:27:25,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:27:25,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:27:25,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:27:25,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:27:25,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:27:25,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:27:25,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:27:25,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:27:25,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:27:25,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:27:25,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:27:25,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:27:25,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:27:25,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:27:25,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:27:25,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:27:25,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:27:25,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:27:25,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:27:25,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:27:25,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:27:25,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:27:25,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:27:25,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:27:25,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:27:25,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:27:25,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:27:25,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:27:25,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:27:25,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:27:25,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:27:25,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:27:25,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:27:25,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:27:25,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:27:25,479 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:27:25,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:27:25,479 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:27:25,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:27:25,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:27:25,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:27:25,481 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:27:25,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:27:25,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:27:25,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:27:25,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:27:25,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:27:25,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:27:25,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:27:25,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:27:25,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:27:25,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:27:25,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:27:25,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:27:25,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:27:25,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:27:25,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:27:25,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:27:25,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:27:25,860 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:27:25,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-06 21:27:25,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c55a5b/b11d7f9a08ca4f0eaecf134508d2ec10/FLAG4e9d0e958 [2019-11-06 21:27:26,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:27:26,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-11-06 21:27:26,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c55a5b/b11d7f9a08ca4f0eaecf134508d2ec10/FLAG4e9d0e958 [2019-11-06 21:27:26,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5c55a5b/b11d7f9a08ca4f0eaecf134508d2ec10 [2019-11-06 21:27:26,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:27:26,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:27:26,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:26,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:27:26,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:27:26,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:26" (1/1) ... [2019-11-06 21:27:26,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295cd445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:26, skipping insertion in model container [2019-11-06 21:27:26,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:27:26" (1/1) ... [2019-11-06 21:27:26,818 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:27:26,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:27:27,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:27,417 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:27:27,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:27:27,532 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:27:27,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27 WrapperNode [2019-11-06 21:27:27,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:27:27,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:27:27,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:27:27,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:27:27,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... [2019-11-06 21:27:27,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:27:27,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:27:27,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:27:27,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:27:27,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:27:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:27:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:27:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-11-06 21:27:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-11-06 21:27:27,692 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-11-06 21:27:27,693 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-11-06 21:27:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-11-06 21:27:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-11-06 21:27:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-11-06 21:27:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-11-06 21:27:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-11-06 21:27:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-11-06 21:27:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-11-06 21:27:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-11-06 21:27:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-11-06 21:27:27,695 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-11-06 21:27:27,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-11-06 21:27:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-11-06 21:27:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-11-06 21:27:27,698 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-11-06 21:27:27,699 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-11-06 21:27:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:27:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:27:27,937 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,021 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,021 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,039 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,050 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,051 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,058 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,354 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-06 21:27:28,354 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-06 21:27:28,357 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,444 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-11-06 21:27:28,445 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-11-06 21:27:28,469 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,494 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-11-06 21:27:28,494 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-11-06 21:27:28,597 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,606 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,606 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,607 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,615 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,615 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,616 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,625 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,626 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,691 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,725 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-11-06 21:27:28,725 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-11-06 21:27:28,750 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,759 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,774 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,774 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,775 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 21:27:28,785 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-11-06 21:27:28,785 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-11-06 21:27:28,794 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:27:28,795 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:27:28,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:28 BoogieIcfgContainer [2019-11-06 21:27:28,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:27:28,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:27:28,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:27:28,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:27:28,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:27:26" (1/3) ... [2019-11-06 21:27:28,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503fe438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:28, skipping insertion in model container [2019-11-06 21:27:28,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:27:27" (2/3) ... [2019-11-06 21:27:28,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503fe438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:27:28, skipping insertion in model container [2019-11-06 21:27:28,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:27:28" (3/3) ... [2019-11-06 21:27:28,804 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-11-06 21:27:28,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:27:28,821 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:27:28,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:27:28,857 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:27:28,858 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:27:28,858 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:27:28,858 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:27:28,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:27:28,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:27:28,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:27:28,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:27:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-11-06 21:27:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:27:28,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:28,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:28,892 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash -194924121, now seen corresponding path program 1 times [2019-11-06 21:27:28,907 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:28,907 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421101578] [2019-11-06 21:27:28,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:29,416 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421101578] [2019-11-06 21:27:29,420 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:29,420 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:27:29,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815417625] [2019-11-06 21:27:29,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:27:29,426 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:27:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:29,439 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 5 states. [2019-11-06 21:27:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:30,983 INFO L93 Difference]: Finished difference Result 538 states and 779 transitions. [2019-11-06 21:27:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:27:30,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:27:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:31,005 INFO L225 Difference]: With dead ends: 538 [2019-11-06 21:27:31,005 INFO L226 Difference]: Without dead ends: 322 [2019-11-06 21:27:31,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:27:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-06 21:27:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2019-11-06 21:27:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-06 21:27:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2019-11-06 21:27:31,103 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2019-11-06 21:27:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:31,104 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2019-11-06 21:27:31,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:27:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2019-11-06 21:27:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:31,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:31,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:31,107 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:31,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash -632063438, now seen corresponding path program 1 times [2019-11-06 21:27:31,107 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:31,108 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121619536] [2019-11-06 21:27:31,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:31,517 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121619536] [2019-11-06 21:27:31,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:31,517 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:27:31,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252443832] [2019-11-06 21:27:31,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:27:31,520 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:31,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:27:31,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:31,521 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 7 states. [2019-11-06 21:27:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:33,959 INFO L93 Difference]: Finished difference Result 846 states and 1124 transitions. [2019-11-06 21:27:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:33,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-06 21:27:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:33,965 INFO L225 Difference]: With dead ends: 846 [2019-11-06 21:27:33,965 INFO L226 Difference]: Without dead ends: 575 [2019-11-06 21:27:33,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-06 21:27:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 381. [2019-11-06 21:27:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-06 21:27:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2019-11-06 21:27:34,045 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 28 [2019-11-06 21:27:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:34,045 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2019-11-06 21:27:34,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:27:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2019-11-06 21:27:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:27:34,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:34,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:34,047 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash 177283188, now seen corresponding path program 1 times [2019-11-06 21:27:34,048 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:34,048 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579132243] [2019-11-06 21:27:34,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:34,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579132243] [2019-11-06 21:27:34,258 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:34,258 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:34,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683306460] [2019-11-06 21:27:34,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:34,259 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:34,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:34,260 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand 6 states. [2019-11-06 21:27:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:36,383 INFO L93 Difference]: Finished difference Result 758 states and 1012 transitions. [2019-11-06 21:27:36,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:36,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-06 21:27:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:36,391 INFO L225 Difference]: With dead ends: 758 [2019-11-06 21:27:36,391 INFO L226 Difference]: Without dead ends: 597 [2019-11-06 21:27:36,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-06 21:27:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 524. [2019-11-06 21:27:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-11-06 21:27:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 686 transitions. [2019-11-06 21:27:36,481 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 686 transitions. Word has length 28 [2019-11-06 21:27:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:36,482 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 686 transitions. [2019-11-06 21:27:36,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2019-11-06 21:27:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:27:36,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:36,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:36,484 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 182749823, now seen corresponding path program 1 times [2019-11-06 21:27:36,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:36,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134835993] [2019-11-06 21:27:36,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:36,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134835993] [2019-11-06 21:27:36,693 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:36,693 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:36,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250046157] [2019-11-06 21:27:36,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:36,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:36,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:36,695 INFO L87 Difference]: Start difference. First operand 524 states and 686 transitions. Second operand 6 states. [2019-11-06 21:27:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:38,350 INFO L93 Difference]: Finished difference Result 1076 states and 1422 transitions. [2019-11-06 21:27:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:38,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-06 21:27:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:38,357 INFO L225 Difference]: With dead ends: 1076 [2019-11-06 21:27:38,357 INFO L226 Difference]: Without dead ends: 771 [2019-11-06 21:27:38,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-11-06 21:27:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 712. [2019-11-06 21:27:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-11-06 21:27:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 943 transitions. [2019-11-06 21:27:38,425 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 943 transitions. Word has length 30 [2019-11-06 21:27:38,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:38,425 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 943 transitions. [2019-11-06 21:27:38,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 943 transitions. [2019-11-06 21:27:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:27:38,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:38,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:38,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1294168590, now seen corresponding path program 1 times [2019-11-06 21:27:38,428 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:38,429 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435838310] [2019-11-06 21:27:38,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:38,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435838310] [2019-11-06 21:27:38,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:38,595 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:38,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912942491] [2019-11-06 21:27:38,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:38,596 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:38,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:38,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:38,597 INFO L87 Difference]: Start difference. First operand 712 states and 943 transitions. Second operand 6 states. [2019-11-06 21:27:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:40,003 INFO L93 Difference]: Finished difference Result 886 states and 1160 transitions. [2019-11-06 21:27:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:40,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-06 21:27:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:40,009 INFO L225 Difference]: With dead ends: 886 [2019-11-06 21:27:40,009 INFO L226 Difference]: Without dead ends: 868 [2019-11-06 21:27:40,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-11-06 21:27:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 795. [2019-11-06 21:27:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-06 21:27:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1049 transitions. [2019-11-06 21:27:40,079 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1049 transitions. Word has length 34 [2019-11-06 21:27:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:40,080 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1049 transitions. [2019-11-06 21:27:40,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1049 transitions. [2019-11-06 21:27:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:27:40,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:40,083 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:40,083 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2013424057, now seen corresponding path program 1 times [2019-11-06 21:27:40,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:40,084 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151709440] [2019-11-06 21:27:40,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:40,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151709440] [2019-11-06 21:27:40,319 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:40,319 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:27:40,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591610886] [2019-11-06 21:27:40,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:27:40,320 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:27:40,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:40,321 INFO L87 Difference]: Start difference. First operand 795 states and 1049 transitions. Second operand 7 states. [2019-11-06 21:27:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:41,773 INFO L93 Difference]: Finished difference Result 1181 states and 1582 transitions. [2019-11-06 21:27:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:27:41,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-06 21:27:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:41,781 INFO L225 Difference]: With dead ends: 1181 [2019-11-06 21:27:41,782 INFO L226 Difference]: Without dead ends: 1178 [2019-11-06 21:27:41,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-06 21:27:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 910. [2019-11-06 21:27:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-11-06 21:27:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1207 transitions. [2019-11-06 21:27:41,873 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1207 transitions. Word has length 41 [2019-11-06 21:27:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:41,874 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1207 transitions. [2019-11-06 21:27:41,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:27:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1207 transitions. [2019-11-06 21:27:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 21:27:41,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:41,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:41,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2127814436, now seen corresponding path program 1 times [2019-11-06 21:27:41,882 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:41,882 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896230359] [2019-11-06 21:27:41,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:42,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896230359] [2019-11-06 21:27:42,065 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:42,066 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:27:42,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217362505] [2019-11-06 21:27:42,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:27:42,067 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:27:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:27:42,067 INFO L87 Difference]: Start difference. First operand 910 states and 1207 transitions. Second operand 6 states. [2019-11-06 21:27:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:43,198 INFO L93 Difference]: Finished difference Result 953 states and 1260 transitions. [2019-11-06 21:27:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:27:43,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-06 21:27:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:43,204 INFO L225 Difference]: With dead ends: 953 [2019-11-06 21:27:43,205 INFO L226 Difference]: Without dead ends: 950 [2019-11-06 21:27:43,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:27:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-11-06 21:27:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 921. [2019-11-06 21:27:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-06 21:27:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1219 transitions. [2019-11-06 21:27:43,285 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1219 transitions. Word has length 40 [2019-11-06 21:27:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:43,290 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1219 transitions. [2019-11-06 21:27:43,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:27:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1219 transitions. [2019-11-06 21:27:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 21:27:43,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:43,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:43,297 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -277982875, now seen corresponding path program 1 times [2019-11-06 21:27:43,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:43,299 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148225035] [2019-11-06 21:27:43,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:43,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148225035] [2019-11-06 21:27:43,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:43,517 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:43,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375476721] [2019-11-06 21:27:43,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:43,520 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:43,520 INFO L87 Difference]: Start difference. First operand 921 states and 1219 transitions. Second operand 8 states. [2019-11-06 21:27:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:44,987 INFO L93 Difference]: Finished difference Result 1014 states and 1331 transitions. [2019-11-06 21:27:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:27:44,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-06 21:27:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:44,996 INFO L225 Difference]: With dead ends: 1014 [2019-11-06 21:27:44,996 INFO L226 Difference]: Without dead ends: 1009 [2019-11-06 21:27:44,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:27:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-11-06 21:27:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 960. [2019-11-06 21:27:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-11-06 21:27:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1264 transitions. [2019-11-06 21:27:45,104 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1264 transitions. Word has length 41 [2019-11-06 21:27:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:45,105 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 1264 transitions. [2019-11-06 21:27:45,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1264 transitions. [2019-11-06 21:27:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:27:45,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:45,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:45,107 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2048774711, now seen corresponding path program 1 times [2019-11-06 21:27:45,108 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:45,108 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213566330] [2019-11-06 21:27:45,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:45,468 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213566330] [2019-11-06 21:27:45,470 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:45,470 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 21:27:45,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705485974] [2019-11-06 21:27:45,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:27:45,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:27:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:27:45,471 INFO L87 Difference]: Start difference. First operand 960 states and 1264 transitions. Second operand 11 states. [2019-11-06 21:27:45,734 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-06 21:27:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:49,390 INFO L93 Difference]: Finished difference Result 1784 states and 2332 transitions. [2019-11-06 21:27:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:27:49,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-06 21:27:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:49,397 INFO L225 Difference]: With dead ends: 1784 [2019-11-06 21:27:49,397 INFO L226 Difference]: Without dead ends: 1159 [2019-11-06 21:27:49,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-06 21:27:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-11-06 21:27:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 945. [2019-11-06 21:27:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-06 21:27:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1229 transitions. [2019-11-06 21:27:49,518 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1229 transitions. Word has length 42 [2019-11-06 21:27:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:49,518 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1229 transitions. [2019-11-06 21:27:49,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:27:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1229 transitions. [2019-11-06 21:27:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:27:49,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:49,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:49,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash 424343062, now seen corresponding path program 1 times [2019-11-06 21:27:49,521 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:49,521 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085691227] [2019-11-06 21:27:49,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:49,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085691227] [2019-11-06 21:27:49,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:49,805 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:49,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523637923] [2019-11-06 21:27:49,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:49,805 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:49,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:49,806 INFO L87 Difference]: Start difference. First operand 945 states and 1229 transitions. Second operand 13 states. [2019-11-06 21:27:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:51,937 INFO L93 Difference]: Finished difference Result 1014 states and 1311 transitions. [2019-11-06 21:27:51,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:27:51,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-11-06 21:27:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:51,943 INFO L225 Difference]: With dead ends: 1014 [2019-11-06 21:27:51,943 INFO L226 Difference]: Without dead ends: 1008 [2019-11-06 21:27:51,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:27:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-06 21:27:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 945. [2019-11-06 21:27:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-06 21:27:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1228 transitions. [2019-11-06 21:27:52,026 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1228 transitions. Word has length 42 [2019-11-06 21:27:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:52,027 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1228 transitions. [2019-11-06 21:27:52,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1228 transitions. [2019-11-06 21:27:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 21:27:52,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:52,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:52,028 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash -590658574, now seen corresponding path program 1 times [2019-11-06 21:27:52,029 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:52,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768127041] [2019-11-06 21:27:52,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:52,327 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768127041] [2019-11-06 21:27:52,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:52,328 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:27:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163638126] [2019-11-06 21:27:52,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:27:52,329 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:27:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:52,329 INFO L87 Difference]: Start difference. First operand 945 states and 1228 transitions. Second operand 13 states. [2019-11-06 21:27:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:54,448 INFO L93 Difference]: Finished difference Result 1014 states and 1309 transitions. [2019-11-06 21:27:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:27:54,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-06 21:27:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:54,454 INFO L225 Difference]: With dead ends: 1014 [2019-11-06 21:27:54,455 INFO L226 Difference]: Without dead ends: 1008 [2019-11-06 21:27:54,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:27:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-06 21:27:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 945. [2019-11-06 21:27:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-06 21:27:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1227 transitions. [2019-11-06 21:27:54,541 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1227 transitions. Word has length 43 [2019-11-06 21:27:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:54,541 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1227 transitions. [2019-11-06 21:27:54,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:27:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1227 transitions. [2019-11-06 21:27:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 21:27:54,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:54,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:54,543 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:54,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1046770881, now seen corresponding path program 1 times [2019-11-06 21:27:54,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:54,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819245162] [2019-11-06 21:27:54,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:54,785 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819245162] [2019-11-06 21:27:54,786 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:54,786 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:27:54,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987878863] [2019-11-06 21:27:54,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:27:54,788 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:27:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:54,788 INFO L87 Difference]: Start difference. First operand 945 states and 1227 transitions. Second operand 10 states. [2019-11-06 21:27:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:56,517 INFO L93 Difference]: Finished difference Result 1008 states and 1302 transitions. [2019-11-06 21:27:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:27:56,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-06 21:27:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:56,526 INFO L225 Difference]: With dead ends: 1008 [2019-11-06 21:27:56,526 INFO L226 Difference]: Without dead ends: 990 [2019-11-06 21:27:56,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:27:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-11-06 21:27:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 943. [2019-11-06 21:27:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-06 21:27:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1223 transitions. [2019-11-06 21:27:56,666 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1223 transitions. Word has length 44 [2019-11-06 21:27:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:56,669 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1223 transitions. [2019-11-06 21:27:56,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:27:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1223 transitions. [2019-11-06 21:27:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 21:27:56,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:56,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:56,672 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1366251101, now seen corresponding path program 1 times [2019-11-06 21:27:56,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:56,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930216615] [2019-11-06 21:27:56,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:56,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930216615] [2019-11-06 21:27:56,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:56,963 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:56,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651541145] [2019-11-06 21:27:56,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:56,965 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:56,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:56,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:56,968 INFO L87 Difference]: Start difference. First operand 943 states and 1223 transitions. Second operand 8 states. [2019-11-06 21:27:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:27:59,535 INFO L93 Difference]: Finished difference Result 1062 states and 1346 transitions. [2019-11-06 21:27:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:27:59,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-11-06 21:27:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:27:59,540 INFO L225 Difference]: With dead ends: 1062 [2019-11-06 21:27:59,541 INFO L226 Difference]: Without dead ends: 723 [2019-11-06 21:27:59,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:27:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-06 21:27:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 651. [2019-11-06 21:27:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-06 21:27:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 812 transitions. [2019-11-06 21:27:59,636 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 812 transitions. Word has length 49 [2019-11-06 21:27:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:27:59,636 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 812 transitions. [2019-11-06 21:27:59,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:27:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 812 transitions. [2019-11-06 21:27:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:27:59,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:27:59,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:27:59,639 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:27:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:27:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -759882765, now seen corresponding path program 1 times [2019-11-06 21:27:59,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:27:59,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243701103] [2019-11-06 21:27:59,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:27:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:27:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:27:59,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243701103] [2019-11-06 21:27:59,926 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:27:59,927 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:27:59,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940781322] [2019-11-06 21:27:59,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:27:59,928 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:27:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:27:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:27:59,930 INFO L87 Difference]: Start difference. First operand 651 states and 812 transitions. Second operand 8 states. [2019-11-06 21:28:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:28:01,193 INFO L93 Difference]: Finished difference Result 977 states and 1229 transitions. [2019-11-06 21:28:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:28:01,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-06 21:28:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:28:01,198 INFO L225 Difference]: With dead ends: 977 [2019-11-06 21:28:01,198 INFO L226 Difference]: Without dead ends: 712 [2019-11-06 21:28:01,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:28:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-11-06 21:28:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 665. [2019-11-06 21:28:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-11-06 21:28:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 832 transitions. [2019-11-06 21:28:01,261 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 832 transitions. Word has length 58 [2019-11-06 21:28:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:28:01,261 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 832 transitions. [2019-11-06 21:28:01,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:28:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 832 transitions. [2019-11-06 21:28:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-06 21:28:01,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:28:01,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:28:01,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:28:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:28:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1429960054, now seen corresponding path program 1 times [2019-11-06 21:28:01,264 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:28:01,264 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688672916] [2019-11-06 21:28:01,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:28:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:28:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:28:01,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688672916] [2019-11-06 21:28:01,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:28:01,479 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 21:28:01,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972036236] [2019-11-06 21:28:01,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:28:01,480 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:28:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:28:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:28:01,481 INFO L87 Difference]: Start difference. First operand 665 states and 832 transitions. Second operand 8 states.