java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:37:31,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:37:31,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:37:31,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:37:31,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:37:31,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:37:31,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:37:31,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:37:31,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:37:31,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:37:31,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:37:31,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:37:31,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:37:31,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:37:31,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:37:31,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:37:31,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:37:31,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:37:31,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:37:31,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:37:31,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:37:31,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:37:31,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:37:31,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:37:31,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:37:31,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:37:31,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:37:31,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:37:31,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:37:31,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:37:31,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:37:31,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:37:31,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:37:31,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:37:31,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:37:31,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:37:31,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:37:31,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:37:31,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:37:31,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:37:31,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:37:31,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:37:31,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:37:31,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:37:31,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:37:31,409 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:37:31,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:37:31,410 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:37:31,410 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:37:31,410 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:37:31,411 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:37:31,411 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:37:31,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:37:31,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:37:31,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:37:31,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:37:31,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:37:31,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:37:31,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:37:31,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:37:31,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:37:31,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:37:31,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:37:31,417 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:37:31,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:37:31,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:31,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:37:31,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:37:31,418 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:37:31,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:37:31,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:37:31,418 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:37:31,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:37:31,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:37:31,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:37:31,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:37:31,477 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:37:31,478 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-10-03 02:37:31,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef19951f5/3d75f034c7344f3eb1c2c828b05240f7/FLAGe7c007d8b [2019-10-03 02:37:32,179 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:37:32,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-03 02:37:32,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef19951f5/3d75f034c7344f3eb1c2c828b05240f7/FLAGe7c007d8b [2019-10-03 02:37:32,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef19951f5/3d75f034c7344f3eb1c2c828b05240f7 [2019-10-03 02:37:32,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:37:32,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:37:32,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:32,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:37:32,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:37:32,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:32" (1/1) ... [2019-10-03 02:37:32,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d329d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:32, skipping insertion in model container [2019-10-03 02:37:32,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:32" (1/1) ... [2019-10-03 02:37:32,423 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:37:32,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:37:33,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:33,080 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:37:33,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:33,189 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:37:33,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33 WrapperNode [2019-10-03 02:37:33,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:33,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:37:33,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:37:33,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:37:33,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... [2019-10-03 02:37:33,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:37:33,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:37:33,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:37:33,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:37:33,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:33,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-03 02:37:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:37:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:37:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-03 02:37:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-03 02:37:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-03 02:37:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-03 02:37:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:37:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:37:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:37:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:37:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:37:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-03 02:37:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-03 02:37:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-03 02:37:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:37:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:37:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:37:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:37:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:37:33,572 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:33,673 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:33,673 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:33,697 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:33,724 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:33,724 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:33,738 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,008 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-03 02:37:34,009 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-03 02:37:34,014 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,093 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-03 02:37:34,094 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-03 02:37:34,108 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,128 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:37:34,129 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:37:34,251 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,266 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,266 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,266 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,280 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,280 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,281 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,290 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,291 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,331 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,370 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-03 02:37:34,370 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-03 02:37:34,402 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,411 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,411 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,411 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,425 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,425 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,426 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:34,432 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:34,433 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:34,463 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:37:34,463 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:37:34,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:37:34 BoogieIcfgContainer [2019-10-03 02:37:34,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:37:34,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:37:34,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:37:34,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:37:34,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:37:32" (1/3) ... [2019-10-03 02:37:34,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cc2851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:37:34, skipping insertion in model container [2019-10-03 02:37:34,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:33" (2/3) ... [2019-10-03 02:37:34,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cc2851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:37:34, skipping insertion in model container [2019-10-03 02:37:34,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:37:34" (3/3) ... [2019-10-03 02:37:34,474 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-10-03 02:37:34,485 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:37:34,495 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:37:34,514 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:37:34,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:37:34,546 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:37:34,547 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:37:34,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:37:34,547 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:37:34,547 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:37:34,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:37:34,547 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:37:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-10-03 02:37:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:37:34,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:34,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:34,588 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash -194924121, now seen corresponding path program 1 times [2019-10-03 02:37:34,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:34,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:34,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:34,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:34,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:34,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:34,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:34,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:34,872 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-10-03 02:37:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:35,002 INFO L93 Difference]: Finished difference Result 300 states and 401 transitions. [2019-10-03 02:37:35,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:35,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:37:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:35,035 INFO L225 Difference]: With dead ends: 300 [2019-10-03 02:37:35,035 INFO L226 Difference]: Without dead ends: 292 [2019-10-03 02:37:35,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-03 02:37:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-10-03 02:37:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 02:37:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2019-10-03 02:37:35,136 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2019-10-03 02:37:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:35,137 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2019-10-03 02:37:35,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2019-10-03 02:37:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:37:35,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:35,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:35,141 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -632063438, now seen corresponding path program 1 times [2019-10-03 02:37:35,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:35,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:35,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:35,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:37:35,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:35,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:37:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:37:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:35,418 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand 4 states. [2019-10-03 02:37:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:35,764 INFO L93 Difference]: Finished difference Result 495 states and 639 transitions. [2019-10-03 02:37:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:37:35,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-10-03 02:37:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:35,769 INFO L225 Difference]: With dead ends: 495 [2019-10-03 02:37:35,770 INFO L226 Difference]: Without dead ends: 495 [2019-10-03 02:37:35,771 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-03 02:37:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 381. [2019-10-03 02:37:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-03 02:37:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2019-10-03 02:37:35,824 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 28 [2019-10-03 02:37:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:35,824 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2019-10-03 02:37:35,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:37:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2019-10-03 02:37:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:37:35,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:35,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:35,827 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash 177283188, now seen corresponding path program 1 times [2019-10-03 02:37:35,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:35,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:35,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:35,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:35,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:35,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:35,989 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand 3 states. [2019-10-03 02:37:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:36,127 INFO L93 Difference]: Finished difference Result 536 states and 698 transitions. [2019-10-03 02:37:36,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:36,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:37:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:36,135 INFO L225 Difference]: With dead ends: 536 [2019-10-03 02:37:36,135 INFO L226 Difference]: Without dead ends: 535 [2019-10-03 02:37:36,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-03 02:37:36,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 518. [2019-10-03 02:37:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-10-03 02:37:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 676 transitions. [2019-10-03 02:37:36,201 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 676 transitions. Word has length 28 [2019-10-03 02:37:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:36,202 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 676 transitions. [2019-10-03 02:37:36,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 676 transitions. [2019-10-03 02:37:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:37:36,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:36,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:36,205 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash 182749823, now seen corresponding path program 1 times [2019-10-03 02:37:36,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:36,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:36,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:36,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:36,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:36,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,308 INFO L87 Difference]: Start difference. First operand 518 states and 676 transitions. Second operand 3 states. [2019-10-03 02:37:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:36,357 INFO L93 Difference]: Finished difference Result 731 states and 962 transitions. [2019-10-03 02:37:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:36,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:37:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:36,367 INFO L225 Difference]: With dead ends: 731 [2019-10-03 02:37:36,367 INFO L226 Difference]: Without dead ends: 731 [2019-10-03 02:37:36,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-03 02:37:36,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 700. [2019-10-03 02:37:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-10-03 02:37:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 926 transitions. [2019-10-03 02:37:36,420 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 926 transitions. Word has length 30 [2019-10-03 02:37:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:36,421 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 926 transitions. [2019-10-03 02:37:36,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 926 transitions. [2019-10-03 02:37:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:37:36,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:36,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:36,437 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1294168590, now seen corresponding path program 1 times [2019-10-03 02:37:36,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:36,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:36,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:36,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:36,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:36,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:36,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:36,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,503 INFO L87 Difference]: Start difference. First operand 700 states and 926 transitions. Second operand 3 states. [2019-10-03 02:37:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:36,538 INFO L93 Difference]: Finished difference Result 828 states and 1083 transitions. [2019-10-03 02:37:36,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:36,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:37:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:36,544 INFO L225 Difference]: With dead ends: 828 [2019-10-03 02:37:36,545 INFO L226 Difference]: Without dead ends: 828 [2019-10-03 02:37:36,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-03 02:37:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 783. [2019-10-03 02:37:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-10-03 02:37:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1032 transitions. [2019-10-03 02:37:36,573 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1032 transitions. Word has length 34 [2019-10-03 02:37:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:36,574 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1032 transitions. [2019-10-03 02:37:36,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1032 transitions. [2019-10-03 02:37:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:37:36,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:36,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:36,576 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash 2013424057, now seen corresponding path program 1 times [2019-10-03 02:37:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:36,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:36,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:36,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:36,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,643 INFO L87 Difference]: Start difference. First operand 783 states and 1032 transitions. Second operand 3 states. [2019-10-03 02:37:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:36,751 INFO L93 Difference]: Finished difference Result 1175 states and 1570 transitions. [2019-10-03 02:37:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:36,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-03 02:37:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:36,759 INFO L225 Difference]: With dead ends: 1175 [2019-10-03 02:37:36,759 INFO L226 Difference]: Without dead ends: 1175 [2019-10-03 02:37:36,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-03 02:37:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 910. [2019-10-03 02:37:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-10-03 02:37:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1207 transitions. [2019-10-03 02:37:36,801 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1207 transitions. Word has length 41 [2019-10-03 02:37:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:36,802 INFO L475 AbstractCegarLoop]: Abstraction has 910 states and 1207 transitions. [2019-10-03 02:37:36,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1207 transitions. [2019-10-03 02:37:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:37:36,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:36,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:36,805 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2127814436, now seen corresponding path program 1 times [2019-10-03 02:37:36,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:36,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:36,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:36,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:36,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,869 INFO L87 Difference]: Start difference. First operand 910 states and 1207 transitions. Second operand 3 states. [2019-10-03 02:37:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:36,987 INFO L93 Difference]: Finished difference Result 922 states and 1221 transitions. [2019-10-03 02:37:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:36,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-03 02:37:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:36,993 INFO L225 Difference]: With dead ends: 922 [2019-10-03 02:37:36,993 INFO L226 Difference]: Without dead ends: 922 [2019-10-03 02:37:36,994 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-03 02:37:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 921. [2019-10-03 02:37:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-10-03 02:37:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1219 transitions. [2019-10-03 02:37:37,026 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1219 transitions. Word has length 40 [2019-10-03 02:37:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:37,028 INFO L475 AbstractCegarLoop]: Abstraction has 921 states and 1219 transitions. [2019-10-03 02:37:37,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1219 transitions. [2019-10-03 02:37:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 02:37:37,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:37,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:37,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash -277982875, now seen corresponding path program 1 times [2019-10-03 02:37:37,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:37,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:37,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:37,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:37,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:37,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:37,084 INFO L87 Difference]: Start difference. First operand 921 states and 1219 transitions. Second operand 3 states. [2019-10-03 02:37:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:37,162 INFO L93 Difference]: Finished difference Result 952 states and 1255 transitions. [2019-10-03 02:37:37,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:37,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-03 02:37:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:37,168 INFO L225 Difference]: With dead ends: 952 [2019-10-03 02:37:37,168 INFO L226 Difference]: Without dead ends: 952 [2019-10-03 02:37:37,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-03 02:37:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-03 02:37:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-03 02:37:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1254 transitions. [2019-10-03 02:37:37,221 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1254 transitions. Word has length 41 [2019-10-03 02:37:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:37,221 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1254 transitions. [2019-10-03 02:37:37,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1254 transitions. [2019-10-03 02:37:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:37:37,223 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:37,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:37,225 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2048774711, now seen corresponding path program 1 times [2019-10-03 02:37:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:37,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:37,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:37,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:37,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:37,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:37,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:37,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:37,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:37,371 INFO L87 Difference]: Start difference. First operand 950 states and 1254 transitions. Second operand 8 states. [2019-10-03 02:37:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:38,195 INFO L93 Difference]: Finished difference Result 1120 states and 1467 transitions. [2019-10-03 02:37:38,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:37:38,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-03 02:37:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:38,203 INFO L225 Difference]: With dead ends: 1120 [2019-10-03 02:37:38,203 INFO L226 Difference]: Without dead ends: 1120 [2019-10-03 02:37:38,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-10-03 02:37:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 935. [2019-10-03 02:37:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-03 02:37:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1219 transitions. [2019-10-03 02:37:38,243 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1219 transitions. Word has length 42 [2019-10-03 02:37:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:38,245 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1219 transitions. [2019-10-03 02:37:38,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1219 transitions. [2019-10-03 02:37:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 02:37:38,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:38,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:38,247 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 424343062, now seen corresponding path program 1 times [2019-10-03 02:37:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:38,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:38,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:38,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:38,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:38,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:38,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:38,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:38,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:38,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:38,347 INFO L87 Difference]: Start difference. First operand 935 states and 1219 transitions. Second operand 8 states. [2019-10-03 02:37:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:38,972 INFO L93 Difference]: Finished difference Result 951 states and 1234 transitions. [2019-10-03 02:37:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:38,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-03 02:37:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:38,979 INFO L225 Difference]: With dead ends: 951 [2019-10-03 02:37:38,980 INFO L226 Difference]: Without dead ends: 951 [2019-10-03 02:37:38,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:37:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-03 02:37:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 935. [2019-10-03 02:37:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-03 02:37:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1218 transitions. [2019-10-03 02:37:39,018 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1218 transitions. Word has length 42 [2019-10-03 02:37:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:39,018 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1218 transitions. [2019-10-03 02:37:39,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1218 transitions. [2019-10-03 02:37:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 02:37:39,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:39,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:39,020 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash -590658574, now seen corresponding path program 1 times [2019-10-03 02:37:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:39,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:39,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:39,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:39,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:39,149 INFO L87 Difference]: Start difference. First operand 935 states and 1218 transitions. Second operand 8 states. [2019-10-03 02:37:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:39,741 INFO L93 Difference]: Finished difference Result 951 states and 1232 transitions. [2019-10-03 02:37:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:39,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-03 02:37:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:39,748 INFO L225 Difference]: With dead ends: 951 [2019-10-03 02:37:39,748 INFO L226 Difference]: Without dead ends: 951 [2019-10-03 02:37:39,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:37:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-03 02:37:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 935. [2019-10-03 02:37:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-10-03 02:37:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1217 transitions. [2019-10-03 02:37:39,778 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1217 transitions. Word has length 43 [2019-10-03 02:37:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:39,778 INFO L475 AbstractCegarLoop]: Abstraction has 935 states and 1217 transitions. [2019-10-03 02:37:39,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1217 transitions. [2019-10-03 02:37:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:37:39,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:39,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:39,781 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1046770881, now seen corresponding path program 1 times [2019-10-03 02:37:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:39,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:39,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:39,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:39,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:39,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:39,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:39,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:39,873 INFO L87 Difference]: Start difference. First operand 935 states and 1217 transitions. Second operand 5 states. [2019-10-03 02:37:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:39,898 INFO L93 Difference]: Finished difference Result 948 states and 1229 transitions. [2019-10-03 02:37:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:39,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-03 02:37:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:39,903 INFO L225 Difference]: With dead ends: 948 [2019-10-03 02:37:39,903 INFO L226 Difference]: Without dead ends: 933 [2019-10-03 02:37:39,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-10-03 02:37:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2019-10-03 02:37:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2019-10-03 02:37:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1213 transitions. [2019-10-03 02:37:39,933 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1213 transitions. Word has length 44 [2019-10-03 02:37:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:39,934 INFO L475 AbstractCegarLoop]: Abstraction has 933 states and 1213 transitions. [2019-10-03 02:37:39,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1213 transitions. [2019-10-03 02:37:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:37:39,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:39,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:39,936 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1366251101, now seen corresponding path program 1 times [2019-10-03 02:37:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:39,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:39,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:40,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:37:40,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:37:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:37:40,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:40,003 INFO L87 Difference]: Start difference. First operand 933 states and 1213 transitions. Second operand 4 states. [2019-10-03 02:37:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,176 INFO L93 Difference]: Finished difference Result 684 states and 852 transitions. [2019-10-03 02:37:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:37:40,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-03 02:37:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,179 INFO L225 Difference]: With dead ends: 684 [2019-10-03 02:37:40,180 INFO L226 Difference]: Without dead ends: 684 [2019-10-03 02:37:40,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-03 02:37:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 647. [2019-10-03 02:37:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-03 02:37:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 808 transitions. [2019-10-03 02:37:40,196 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 808 transitions. Word has length 49 [2019-10-03 02:37:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:40,197 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 808 transitions. [2019-10-03 02:37:40,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:37:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 808 transitions. [2019-10-03 02:37:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 02:37:40,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:40,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:40,199 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:40,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1393689715, now seen corresponding path program 1 times [2019-10-03 02:37:40,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:40,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:40,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:40,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:40,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:40,264 INFO L87 Difference]: Start difference. First operand 647 states and 808 transitions. Second operand 3 states. [2019-10-03 02:37:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,316 INFO L93 Difference]: Finished difference Result 655 states and 819 transitions. [2019-10-03 02:37:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:40,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-03 02:37:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,320 INFO L225 Difference]: With dead ends: 655 [2019-10-03 02:37:40,320 INFO L226 Difference]: Without dead ends: 655 [2019-10-03 02:37:40,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-03 02:37:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-03 02:37:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-03 02:37:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 819 transitions. [2019-10-03 02:37:40,336 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 819 transitions. Word has length 55 [2019-10-03 02:37:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:40,337 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 819 transitions. [2019-10-03 02:37:40,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 819 transitions. [2019-10-03 02:37:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:37:40,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:40,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:40,339 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1429960054, now seen corresponding path program 1 times [2019-10-03 02:37:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:40,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:40,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:40,383 INFO L87 Difference]: Start difference. First operand 655 states and 819 transitions. Second operand 3 states. [2019-10-03 02:37:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,485 INFO L93 Difference]: Finished difference Result 851 states and 1080 transitions. [2019-10-03 02:37:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:40,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-03 02:37:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,490 INFO L225 Difference]: With dead ends: 851 [2019-10-03 02:37:40,490 INFO L226 Difference]: Without dead ends: 851 [2019-10-03 02:37:40,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-10-03 02:37:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 721. [2019-10-03 02:37:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-10-03 02:37:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 899 transitions. [2019-10-03 02:37:40,512 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 899 transitions. Word has length 52 [2019-10-03 02:37:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:40,513 INFO L475 AbstractCegarLoop]: Abstraction has 721 states and 899 transitions. [2019-10-03 02:37:40,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 899 transitions. [2019-10-03 02:37:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:37:40,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:40,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:40,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash -927211119, now seen corresponding path program 1 times [2019-10-03 02:37:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:40,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:40,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:40,605 INFO L87 Difference]: Start difference. First operand 721 states and 899 transitions. Second operand 8 states. [2019-10-03 02:37:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,686 INFO L93 Difference]: Finished difference Result 810 states and 1020 transitions. [2019-10-03 02:37:40,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:40,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-03 02:37:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,691 INFO L225 Difference]: With dead ends: 810 [2019-10-03 02:37:40,691 INFO L226 Difference]: Without dead ends: 807 [2019-10-03 02:37:40,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:37:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-10-03 02:37:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 768. [2019-10-03 02:37:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-03 02:37:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 970 transitions. [2019-10-03 02:37:40,712 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 970 transitions. Word has length 53 [2019-10-03 02:37:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:40,712 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 970 transitions. [2019-10-03 02:37:40,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 970 transitions. [2019-10-03 02:37:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:37:40,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:40,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:40,715 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash -926934289, now seen corresponding path program 1 times [2019-10-03 02:37:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:40,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:40,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:40,782 INFO L87 Difference]: Start difference. First operand 768 states and 970 transitions. Second operand 8 states. [2019-10-03 02:37:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,963 INFO L93 Difference]: Finished difference Result 795 states and 1001 transitions. [2019-10-03 02:37:40,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:40,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-03 02:37:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,972 INFO L225 Difference]: With dead ends: 795 [2019-10-03 02:37:40,972 INFO L226 Difference]: Without dead ends: 782 [2019-10-03 02:37:40,973 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-10-03 02:37:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 774. [2019-10-03 02:37:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-03 02:37:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 975 transitions. [2019-10-03 02:37:41,049 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 975 transitions. Word has length 53 [2019-10-03 02:37:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,049 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 975 transitions. [2019-10-03 02:37:41,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 975 transitions. [2019-10-03 02:37:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 02:37:41,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:41,061 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2047432327, now seen corresponding path program 1 times [2019-10-03 02:37:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:41,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:41,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:41,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:41,250 INFO L87 Difference]: Start difference. First operand 774 states and 975 transitions. Second operand 5 states. [2019-10-03 02:37:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:41,269 INFO L93 Difference]: Finished difference Result 755 states and 945 transitions. [2019-10-03 02:37:41,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:41,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-03 02:37:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:41,275 INFO L225 Difference]: With dead ends: 755 [2019-10-03 02:37:41,275 INFO L226 Difference]: Without dead ends: 755 [2019-10-03 02:37:41,276 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-03 02:37:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-10-03 02:37:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-03 02:37:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 945 transitions. [2019-10-03 02:37:41,301 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 945 transitions. Word has length 61 [2019-10-03 02:37:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,302 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 945 transitions. [2019-10-03 02:37:41,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 945 transitions. [2019-10-03 02:37:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:37:41,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:41,305 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash -465967953, now seen corresponding path program 1 times [2019-10-03 02:37:41,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:41,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:41,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:41,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:41,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:41,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:41,371 INFO L87 Difference]: Start difference. First operand 755 states and 945 transitions. Second operand 3 states. [2019-10-03 02:37:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:41,436 INFO L93 Difference]: Finished difference Result 850 states and 1057 transitions. [2019-10-03 02:37:41,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:41,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-03 02:37:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:41,441 INFO L225 Difference]: With dead ends: 850 [2019-10-03 02:37:41,441 INFO L226 Difference]: Without dead ends: 841 [2019-10-03 02:37:41,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-03 02:37:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 831. [2019-10-03 02:37:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-10-03 02:37:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1038 transitions. [2019-10-03 02:37:41,463 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1038 transitions. Word has length 54 [2019-10-03 02:37:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,463 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1038 transitions. [2019-10-03 02:37:41,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1038 transitions. [2019-10-03 02:37:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:37:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:41,466 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash -609247311, now seen corresponding path program 1 times [2019-10-03 02:37:41,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:41,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:37:41,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:41,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:37:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:37:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:41,539 INFO L87 Difference]: Start difference. First operand 831 states and 1038 transitions. Second operand 7 states. [2019-10-03 02:37:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:42,280 INFO L93 Difference]: Finished difference Result 759 states and 938 transitions. [2019-10-03 02:37:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:42,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-03 02:37:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:42,285 INFO L225 Difference]: With dead ends: 759 [2019-10-03 02:37:42,285 INFO L226 Difference]: Without dead ends: 759 [2019-10-03 02:37:42,286 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:37:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-10-03 02:37:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 713. [2019-10-03 02:37:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-10-03 02:37:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 881 transitions. [2019-10-03 02:37:42,307 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 881 transitions. Word has length 54 [2019-10-03 02:37:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:42,308 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 881 transitions. [2019-10-03 02:37:42,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:37:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 881 transitions. [2019-10-03 02:37:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:37:42,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:42,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:42,311 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1238038488, now seen corresponding path program 1 times [2019-10-03 02:37:42,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:42,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:42,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:42,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:42,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:37:42,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:42,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:37:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:37:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:37:42,532 INFO L87 Difference]: Start difference. First operand 713 states and 881 transitions. Second operand 15 states. [2019-10-03 02:37:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:45,134 INFO L93 Difference]: Finished difference Result 798 states and 997 transitions. [2019-10-03 02:37:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:37:45,135 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-10-03 02:37:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:45,139 INFO L225 Difference]: With dead ends: 798 [2019-10-03 02:37:45,139 INFO L226 Difference]: Without dead ends: 785 [2019-10-03 02:37:45,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2019-10-03 02:37:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-10-03 02:37:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 714. [2019-10-03 02:37:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-03 02:37:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 883 transitions. [2019-10-03 02:37:45,162 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 883 transitions. Word has length 54 [2019-10-03 02:37:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:45,162 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 883 transitions. [2019-10-03 02:37:45,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:37:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 883 transitions. [2019-10-03 02:37:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-03 02:37:45,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:45,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:45,166 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1268553704, now seen corresponding path program 1 times [2019-10-03 02:37:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:45,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:45,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:45,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:45,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:37:45,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:45,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:37:45,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:37:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:37:45,292 INFO L87 Difference]: Start difference. First operand 714 states and 883 transitions. Second operand 10 states. [2019-10-03 02:37:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:46,957 INFO L93 Difference]: Finished difference Result 800 states and 990 transitions. [2019-10-03 02:37:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:37:46,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-03 02:37:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:46,964 INFO L225 Difference]: With dead ends: 800 [2019-10-03 02:37:46,964 INFO L226 Difference]: Without dead ends: 788 [2019-10-03 02:37:46,964 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:37:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-03 02:37:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 780. [2019-10-03 02:37:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-10-03 02:37:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 964 transitions. [2019-10-03 02:37:46,987 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 964 transitions. Word has length 54 [2019-10-03 02:37:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:46,987 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 964 transitions. [2019-10-03 02:37:46,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:37:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 964 transitions. [2019-10-03 02:37:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 02:37:46,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:46,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:46,990 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 329035060, now seen corresponding path program 1 times [2019-10-03 02:37:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:46,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:46,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:47,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:47,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:47,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:47,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:47,059 INFO L87 Difference]: Start difference. First operand 780 states and 964 transitions. Second operand 6 states. [2019-10-03 02:37:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:47,104 INFO L93 Difference]: Finished difference Result 796 states and 979 transitions. [2019-10-03 02:37:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:47,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-03 02:37:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:47,108 INFO L225 Difference]: With dead ends: 796 [2019-10-03 02:37:47,109 INFO L226 Difference]: Without dead ends: 746 [2019-10-03 02:37:47,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-03 02:37:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2019-10-03 02:37:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-03 02:37:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 922 transitions. [2019-10-03 02:37:47,129 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 922 transitions. Word has length 57 [2019-10-03 02:37:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:47,130 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 922 transitions. [2019-10-03 02:37:47,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 922 transitions. [2019-10-03 02:37:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:37:47,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:47,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:47,132 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 932474003, now seen corresponding path program 1 times [2019-10-03 02:37:47,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:47,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:47,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:47,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:47,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:47,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:37:47,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:47,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:37:47,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:37:47,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:47,326 INFO L87 Difference]: Start difference. First operand 746 states and 922 transitions. Second operand 11 states. [2019-10-03 02:37:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:48,149 INFO L93 Difference]: Finished difference Result 803 states and 1006 transitions. [2019-10-03 02:37:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:37:48,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-03 02:37:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:48,154 INFO L225 Difference]: With dead ends: 803 [2019-10-03 02:37:48,154 INFO L226 Difference]: Without dead ends: 791 [2019-10-03 02:37:48,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:37:48,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-03 02:37:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 746. [2019-10-03 02:37:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-03 02:37:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 922 transitions. [2019-10-03 02:37:48,178 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 922 transitions. Word has length 56 [2019-10-03 02:37:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:48,178 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 922 transitions. [2019-10-03 02:37:48,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:37:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 922 transitions. [2019-10-03 02:37:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:37:48,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:48,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:48,181 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1574030547, now seen corresponding path program 1 times [2019-10-03 02:37:48,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:48,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:48,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:48,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:48,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:48,249 INFO L87 Difference]: Start difference. First operand 746 states and 922 transitions. Second operand 5 states. [2019-10-03 02:37:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:48,532 INFO L93 Difference]: Finished difference Result 756 states and 930 transitions. [2019-10-03 02:37:48,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:48,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-03 02:37:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:48,536 INFO L225 Difference]: With dead ends: 756 [2019-10-03 02:37:48,536 INFO L226 Difference]: Without dead ends: 742 [2019-10-03 02:37:48,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-10-03 02:37:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 728. [2019-10-03 02:37:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-03 02:37:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 896 transitions. [2019-10-03 02:37:48,560 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 896 transitions. Word has length 56 [2019-10-03 02:37:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:48,561 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 896 transitions. [2019-10-03 02:37:48,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 896 transitions. [2019-10-03 02:37:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:37:48,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:48,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:48,563 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash -386931168, now seen corresponding path program 1 times [2019-10-03 02:37:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:48,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:48,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:48,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:48,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:48,632 INFO L87 Difference]: Start difference. First operand 728 states and 896 transitions. Second operand 5 states. [2019-10-03 02:37:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:48,877 INFO L93 Difference]: Finished difference Result 728 states and 894 transitions. [2019-10-03 02:37:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:48,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-03 02:37:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:48,881 INFO L225 Difference]: With dead ends: 728 [2019-10-03 02:37:48,881 INFO L226 Difference]: Without dead ends: 728 [2019-10-03 02:37:48,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-03 02:37:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-10-03 02:37:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-10-03 02:37:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 894 transitions. [2019-10-03 02:37:48,898 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 894 transitions. Word has length 65 [2019-10-03 02:37:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:48,898 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 894 transitions. [2019-10-03 02:37:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 894 transitions. [2019-10-03 02:37:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:37:48,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:48,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:48,901 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -976640211, now seen corresponding path program 1 times [2019-10-03 02:37:48,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:48,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:48,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:48,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:48,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:48,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:48,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:48,975 INFO L87 Difference]: Start difference. First operand 728 states and 894 transitions. Second operand 9 states. [2019-10-03 02:37:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:49,155 INFO L93 Difference]: Finished difference Result 754 states and 920 transitions. [2019-10-03 02:37:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:49,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-10-03 02:37:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:49,158 INFO L225 Difference]: With dead ends: 754 [2019-10-03 02:37:49,159 INFO L226 Difference]: Without dead ends: 723 [2019-10-03 02:37:49,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-03 02:37:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-10-03 02:37:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-10-03 02:37:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 886 transitions. [2019-10-03 02:37:49,176 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 886 transitions. Word has length 58 [2019-10-03 02:37:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:49,176 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 886 transitions. [2019-10-03 02:37:49,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 886 transitions. [2019-10-03 02:37:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:37:49,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:49,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:49,179 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1616889087, now seen corresponding path program 1 times [2019-10-03 02:37:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:49,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:49,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:49,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:49,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:49,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:49,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:49,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:49,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:49,296 INFO L87 Difference]: Start difference. First operand 723 states and 886 transitions. Second operand 9 states. [2019-10-03 02:37:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:49,457 INFO L93 Difference]: Finished difference Result 749 states and 912 transitions. [2019-10-03 02:37:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:49,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 02:37:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:49,466 INFO L225 Difference]: With dead ends: 749 [2019-10-03 02:37:49,466 INFO L226 Difference]: Without dead ends: 717 [2019-10-03 02:37:49,467 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-03 02:37:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2019-10-03 02:37:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-03 02:37:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 877 transitions. [2019-10-03 02:37:49,489 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 877 transitions. Word has length 59 [2019-10-03 02:37:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:49,490 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 877 transitions. [2019-10-03 02:37:49,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 877 transitions. [2019-10-03 02:37:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:37:49,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:49,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:49,494 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash -631338351, now seen corresponding path program 1 times [2019-10-03 02:37:49,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:49,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:49,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:49,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:49,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:49,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:49,588 INFO L87 Difference]: Start difference. First operand 717 states and 877 transitions. Second operand 9 states. [2019-10-03 02:37:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:49,743 INFO L93 Difference]: Finished difference Result 743 states and 903 transitions. [2019-10-03 02:37:49,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:49,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-03 02:37:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:49,747 INFO L225 Difference]: With dead ends: 743 [2019-10-03 02:37:49,747 INFO L226 Difference]: Without dead ends: 712 [2019-10-03 02:37:49,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-10-03 02:37:49,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2019-10-03 02:37:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-03 02:37:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 869 transitions. [2019-10-03 02:37:49,767 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 869 transitions. Word has length 59 [2019-10-03 02:37:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:49,767 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 869 transitions. [2019-10-03 02:37:49,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 869 transitions. [2019-10-03 02:37:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-03 02:37:49,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:49,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:49,769 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1272366496, now seen corresponding path program 1 times [2019-10-03 02:37:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:49,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:49,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:49,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:49,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:49,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:49,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:49,858 INFO L87 Difference]: Start difference. First operand 712 states and 869 transitions. Second operand 6 states. [2019-10-03 02:37:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:49,903 INFO L93 Difference]: Finished difference Result 755 states and 925 transitions. [2019-10-03 02:37:49,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:49,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-10-03 02:37:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:49,908 INFO L225 Difference]: With dead ends: 755 [2019-10-03 02:37:49,909 INFO L226 Difference]: Without dead ends: 755 [2019-10-03 02:37:49,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:49,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-03 02:37:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 712. [2019-10-03 02:37:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-03 02:37:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 867 transitions. [2019-10-03 02:37:49,927 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 867 transitions. Word has length 68 [2019-10-03 02:37:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:49,928 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 867 transitions. [2019-10-03 02:37:49,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 867 transitions. [2019-10-03 02:37:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 02:37:49,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:49,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:49,931 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:49,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1955784685, now seen corresponding path program 1 times [2019-10-03 02:37:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:49,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:49,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:50,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:50,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:50,075 INFO L87 Difference]: Start difference. First operand 712 states and 867 transitions. Second operand 5 states. [2019-10-03 02:37:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:50,523 INFO L93 Difference]: Finished difference Result 816 states and 994 transitions. [2019-10-03 02:37:50,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:50,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-03 02:37:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:50,531 INFO L225 Difference]: With dead ends: 816 [2019-10-03 02:37:50,531 INFO L226 Difference]: Without dead ends: 816 [2019-10-03 02:37:50,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-10-03 02:37:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 786. [2019-10-03 02:37:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-10-03 02:37:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 961 transitions. [2019-10-03 02:37:50,550 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 961 transitions. Word has length 67 [2019-10-03 02:37:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:50,550 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 961 transitions. [2019-10-03 02:37:50,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 961 transitions. [2019-10-03 02:37:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:37:50,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:50,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:50,553 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1248598314, now seen corresponding path program 1 times [2019-10-03 02:37:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:50,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:50,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:50,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:50,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:50,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:50,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:50,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:50,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:50,644 INFO L87 Difference]: Start difference. First operand 786 states and 961 transitions. Second operand 9 states. [2019-10-03 02:37:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:50,841 INFO L93 Difference]: Finished difference Result 812 states and 987 transitions. [2019-10-03 02:37:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:50,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-03 02:37:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:50,845 INFO L225 Difference]: With dead ends: 812 [2019-10-03 02:37:50,845 INFO L226 Difference]: Without dead ends: 740 [2019-10-03 02:37:50,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-10-03 02:37:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2019-10-03 02:37:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-10-03 02:37:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 904 transitions. [2019-10-03 02:37:50,872 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 904 transitions. Word has length 63 [2019-10-03 02:37:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:50,873 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 904 transitions. [2019-10-03 02:37:50,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 904 transitions. [2019-10-03 02:37:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 02:37:50,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:50,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:50,880 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash 258674534, now seen corresponding path program 1 times [2019-10-03 02:37:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:50,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:50,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:50,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:50,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:50,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:50,989 INFO L87 Difference]: Start difference. First operand 740 states and 904 transitions. Second operand 6 states. [2019-10-03 02:37:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:51,657 INFO L93 Difference]: Finished difference Result 735 states and 890 transitions. [2019-10-03 02:37:51,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:51,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-03 02:37:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:51,661 INFO L225 Difference]: With dead ends: 735 [2019-10-03 02:37:51,661 INFO L226 Difference]: Without dead ends: 735 [2019-10-03 02:37:51,662 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:37:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-03 02:37:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2019-10-03 02:37:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-03 02:37:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 876 transitions. [2019-10-03 02:37:51,677 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 876 transitions. Word has length 79 [2019-10-03 02:37:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:51,677 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 876 transitions. [2019-10-03 02:37:51,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 876 transitions. [2019-10-03 02:37:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-03 02:37:51,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:51,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:51,680 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash 58561833, now seen corresponding path program 1 times [2019-10-03 02:37:51,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:51,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:51,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:51,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:51,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:51,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:51,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:51,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:51,788 INFO L87 Difference]: Start difference. First operand 724 states and 876 transitions. Second operand 6 states. [2019-10-03 02:37:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:51,828 INFO L93 Difference]: Finished difference Result 803 states and 1006 transitions. [2019-10-03 02:37:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:51,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-03 02:37:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:51,832 INFO L225 Difference]: With dead ends: 803 [2019-10-03 02:37:51,832 INFO L226 Difference]: Without dead ends: 803 [2019-10-03 02:37:51,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-10-03 02:37:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 690. [2019-10-03 02:37:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-10-03 02:37:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 832 transitions. [2019-10-03 02:37:51,845 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 832 transitions. Word has length 80 [2019-10-03 02:37:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:51,846 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 832 transitions. [2019-10-03 02:37:51,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 832 transitions. [2019-10-03 02:37:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 02:37:51,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:51,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:51,848 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 436175383, now seen corresponding path program 1 times [2019-10-03 02:37:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:51,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:51,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:51,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:51,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:51,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:51,904 INFO L87 Difference]: Start difference. First operand 690 states and 832 transitions. Second operand 5 states. [2019-10-03 02:37:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:52,261 INFO L93 Difference]: Finished difference Result 750 states and 879 transitions. [2019-10-03 02:37:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:52,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-03 02:37:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:52,264 INFO L225 Difference]: With dead ends: 750 [2019-10-03 02:37:52,265 INFO L226 Difference]: Without dead ends: 750 [2019-10-03 02:37:52,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-10-03 02:37:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 727. [2019-10-03 02:37:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-03 02:37:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 857 transitions. [2019-10-03 02:37:52,284 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 857 transitions. Word has length 75 [2019-10-03 02:37:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:52,285 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 857 transitions. [2019-10-03 02:37:52,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 857 transitions. [2019-10-03 02:37:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 02:37:52,287 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:52,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:52,287 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1450993742, now seen corresponding path program 1 times [2019-10-03 02:37:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:52,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:52,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:52,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:52,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:52,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:52,369 INFO L87 Difference]: Start difference. First operand 727 states and 857 transitions. Second operand 9 states. [2019-10-03 02:37:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:52,522 INFO L93 Difference]: Finished difference Result 726 states and 855 transitions. [2019-10-03 02:37:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:52,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-03 02:37:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:52,525 INFO L225 Difference]: With dead ends: 726 [2019-10-03 02:37:52,525 INFO L226 Difference]: Without dead ends: 446 [2019-10-03 02:37:52,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-03 02:37:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-03 02:37:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-03 02:37:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 530 transitions. [2019-10-03 02:37:52,537 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 530 transitions. Word has length 76 [2019-10-03 02:37:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:52,537 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 530 transitions. [2019-10-03 02:37:52,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 530 transitions. [2019-10-03 02:37:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 02:37:52,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:52,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:52,543 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1637607580, now seen corresponding path program 1 times [2019-10-03 02:37:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:52,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:52,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:52,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:52,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:52,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:52,630 INFO L87 Difference]: Start difference. First operand 446 states and 530 transitions. Second operand 9 states. [2019-10-03 02:37:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:52,729 INFO L93 Difference]: Finished difference Result 464 states and 548 transitions. [2019-10-03 02:37:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:52,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-03 02:37:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:52,732 INFO L225 Difference]: With dead ends: 464 [2019-10-03 02:37:52,733 INFO L226 Difference]: Without dead ends: 446 [2019-10-03 02:37:52,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:37:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-03 02:37:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-03 02:37:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-03 02:37:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 529 transitions. [2019-10-03 02:37:52,749 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 529 transitions. Word has length 85 [2019-10-03 02:37:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:52,750 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 529 transitions. [2019-10-03 02:37:52,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 529 transitions. [2019-10-03 02:37:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:37:52,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:52,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:52,752 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -274697648, now seen corresponding path program 1 times [2019-10-03 02:37:52,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:52,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:52,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:52,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:52,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:52,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:52,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:52,834 INFO L87 Difference]: Start difference. First operand 446 states and 529 transitions. Second operand 6 states. [2019-10-03 02:37:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:52,860 INFO L93 Difference]: Finished difference Result 442 states and 522 transitions. [2019-10-03 02:37:52,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:52,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:37:52,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:52,863 INFO L225 Difference]: With dead ends: 442 [2019-10-03 02:37:52,863 INFO L226 Difference]: Without dead ends: 440 [2019-10-03 02:37:52,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-03 02:37:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 387. [2019-10-03 02:37:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-03 02:37:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 453 transitions. [2019-10-03 02:37:52,876 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 453 transitions. Word has length 96 [2019-10-03 02:37:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:52,876 INFO L475 AbstractCegarLoop]: Abstraction has 387 states and 453 transitions. [2019-10-03 02:37:52,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 453 transitions. [2019-10-03 02:37:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:37:52,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:52,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:52,879 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:52,879 INFO L82 PathProgramCache]: Analyzing trace with hash -742138889, now seen corresponding path program 1 times [2019-10-03 02:37:52,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:52,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:52,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:37:52,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:52,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:37:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:37:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:52,959 INFO L87 Difference]: Start difference. First operand 387 states and 453 transitions. Second operand 7 states. [2019-10-03 02:37:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:53,061 INFO L93 Difference]: Finished difference Result 727 states and 857 transitions. [2019-10-03 02:37:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:53,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-03 02:37:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:53,064 INFO L225 Difference]: With dead ends: 727 [2019-10-03 02:37:53,064 INFO L226 Difference]: Without dead ends: 685 [2019-10-03 02:37:53,065 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-03 02:37:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 367. [2019-10-03 02:37:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-03 02:37:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 428 transitions. [2019-10-03 02:37:53,075 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 428 transitions. Word has length 96 [2019-10-03 02:37:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:53,077 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 428 transitions. [2019-10-03 02:37:53,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:37:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 428 transitions. [2019-10-03 02:37:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:37:53,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:53,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:53,079 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1608566912, now seen corresponding path program 1 times [2019-10-03 02:37:53,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:53,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:53,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:53,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:37:53,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:53,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:37:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:37:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:53,251 INFO L87 Difference]: Start difference. First operand 367 states and 428 transitions. Second operand 11 states. [2019-10-03 02:37:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:53,360 INFO L93 Difference]: Finished difference Result 395 states and 457 transitions. [2019-10-03 02:37:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:53,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2019-10-03 02:37:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:53,361 INFO L225 Difference]: With dead ends: 395 [2019-10-03 02:37:53,362 INFO L226 Difference]: Without dead ends: 363 [2019-10-03 02:37:53,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:37:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-03 02:37:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 350. [2019-10-03 02:37:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-03 02:37:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2019-10-03 02:37:53,367 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 101 [2019-10-03 02:37:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:53,368 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2019-10-03 02:37:53,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:37:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2019-10-03 02:37:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 02:37:53,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:53,369 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:53,369 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash -18483681, now seen corresponding path program 1 times [2019-10-03 02:37:53,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 02:37:53,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:53,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:53,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:53,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:53,468 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand 6 states. [2019-10-03 02:37:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:53,497 INFO L93 Difference]: Finished difference Result 302 states and 341 transitions. [2019-10-03 02:37:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:53,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-10-03 02:37:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:53,498 INFO L225 Difference]: With dead ends: 302 [2019-10-03 02:37:53,499 INFO L226 Difference]: Without dead ends: 302 [2019-10-03 02:37:53,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-03 02:37:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-10-03 02:37:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-03 02:37:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 265 transitions. [2019-10-03 02:37:53,504 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 265 transitions. Word has length 110 [2019-10-03 02:37:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:53,504 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 265 transitions. [2019-10-03 02:37:53,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 265 transitions. [2019-10-03 02:37:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:37:53,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:53,506 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:53,507 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1525235784, now seen corresponding path program 1 times [2019-10-03 02:37:53,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:53,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:53,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-03 02:37:53,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:53,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:53,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:53,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:53,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:53,608 INFO L87 Difference]: Start difference. First operand 240 states and 265 transitions. Second operand 9 states. [2019-10-03 02:37:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:53,687 INFO L93 Difference]: Finished difference Result 284 states and 322 transitions. [2019-10-03 02:37:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:53,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-03 02:37:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:53,688 INFO L225 Difference]: With dead ends: 284 [2019-10-03 02:37:53,688 INFO L226 Difference]: Without dead ends: 284 [2019-10-03 02:37:53,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-03 02:37:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-10-03 02:37:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-03 02:37:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 290 transitions. [2019-10-03 02:37:53,693 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 290 transitions. Word has length 131 [2019-10-03 02:37:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:53,694 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 290 transitions. [2019-10-03 02:37:53,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 290 transitions. [2019-10-03 02:37:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-03 02:37:53,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:53,696 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:53,696 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2109636131, now seen corresponding path program 1 times [2019-10-03 02:37:53,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:53,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:37:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:53,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:37:53,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:53,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:37:53,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:37:53,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:37:53,932 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand 13 states. [2019-10-03 02:37:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:54,213 INFO L93 Difference]: Finished difference Result 305 states and 347 transitions. [2019-10-03 02:37:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:37:54,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2019-10-03 02:37:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:54,216 INFO L225 Difference]: With dead ends: 305 [2019-10-03 02:37:54,216 INFO L226 Difference]: Without dead ends: 274 [2019-10-03 02:37:54,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:37:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-03 02:37:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 251. [2019-10-03 02:37:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-03 02:37:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2019-10-03 02:37:54,224 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 132 [2019-10-03 02:37:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:54,225 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2019-10-03 02:37:54,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:37:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2019-10-03 02:37:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:37:54,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:54,229 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:54,229 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash 144838378, now seen corresponding path program 1 times [2019-10-03 02:37:54,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:37:54,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:54,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:54,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:54,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:54,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:54,351 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 5 states. [2019-10-03 02:37:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:54,373 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2019-10-03 02:37:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:54,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-03 02:37:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:54,375 INFO L225 Difference]: With dead ends: 257 [2019-10-03 02:37:54,376 INFO L226 Difference]: Without dead ends: 257 [2019-10-03 02:37:54,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-03 02:37:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2019-10-03 02:37:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-03 02:37:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 281 transitions. [2019-10-03 02:37:54,383 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 281 transitions. Word has length 150 [2019-10-03 02:37:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:54,383 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 281 transitions. [2019-10-03 02:37:54,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 281 transitions. [2019-10-03 02:37:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:37:54,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:54,387 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:54,388 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:54,388 INFO L82 PathProgramCache]: Analyzing trace with hash 326324875, now seen corresponding path program 1 times [2019-10-03 02:37:54,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:54,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:37:54,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:54,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:54,613 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-10-03 02:37:54,617 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [457], [460], [462], [465], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [710], [711], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [831], [832], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-10-03 02:37:54,718 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:37:54,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:37:55,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:37:55,187 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:37:55,189 INFO L272 AbstractInterpreter]: Visited 123 different actions 148 times. Never merged. Never widened. Performed 1157 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-10-03 02:37:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:55,194 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:37:55,506 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.7% of their original sizes. [2019-10-03 02:37:55,506 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:38:10,606 INFO L420 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2019-10-03 02:38:10,607 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:38:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:38:10,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [12] total 117 [2019-10-03 02:38:10,607 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:10,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-03 02:38:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-03 02:38:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=10874, Unknown=0, NotChecked=0, Total=11342 [2019-10-03 02:38:10,613 INFO L87 Difference]: Start difference. First operand 255 states and 281 transitions. Second operand 107 states. [2019-10-03 02:39:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:24,551 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions. [2019-10-03 02:39:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-03 02:39:24,551 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-10-03 02:39:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:24,555 INFO L225 Difference]: With dead ends: 578 [2019-10-03 02:39:24,555 INFO L226 Difference]: Without dead ends: 519 [2019-10-03 02:39:24,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4911 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=807, Invalid=19785, Unknown=0, NotChecked=0, Total=20592 [2019-10-03 02:39:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-03 02:39:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 450. [2019-10-03 02:39:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-03 02:39:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 502 transitions. [2019-10-03 02:39:24,571 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 502 transitions. Word has length 150 [2019-10-03 02:39:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:24,571 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 502 transitions. [2019-10-03 02:39:24,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-03 02:39:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 502 transitions. [2019-10-03 02:39:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:39:24,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:24,574 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:39:24,574 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1461544947, now seen corresponding path program 1 times [2019-10-03 02:39:24,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:39:24,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:24,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:24,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 151 with the following transitions: [2019-10-03 02:39:24,719 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [457], [460], [462], [465], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [710], [711], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [831], [832], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-10-03 02:39:24,734 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:24,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:24,775 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:39:24,823 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:24,824 INFO L272 AbstractInterpreter]: Visited 123 different actions 148 times. Never merged. Never widened. Performed 1226 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-10-03 02:39:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:24,824 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:25,051 INFO L227 lantSequenceWeakener]: Weakened 79 states. On average, predicates are now at 84.7% of their original sizes. [2019-10-03 02:39:25,051 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:39,875 INFO L420 sIntCurrentIteration]: We unified 149 AI predicates to 149 [2019-10-03 02:39:39,875 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:39,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:39,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [12] total 117 [2019-10-03 02:39:39,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:39,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-03 02:39:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-03 02:39:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=10871, Unknown=0, NotChecked=0, Total=11342 [2019-10-03 02:39:39,880 INFO L87 Difference]: Start difference. First operand 450 states and 502 transitions. Second operand 107 states. [2019-10-03 02:40:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:34,423 INFO L93 Difference]: Finished difference Result 714 states and 816 transitions. [2019-10-03 02:40:34,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-03 02:40:34,424 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 150 [2019-10-03 02:40:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:34,427 INFO L225 Difference]: With dead ends: 714 [2019-10-03 02:40:34,427 INFO L226 Difference]: Without dead ends: 655 [2019-10-03 02:40:34,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=810, Invalid=19782, Unknown=0, NotChecked=0, Total=20592 [2019-10-03 02:40:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-03 02:40:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 341. [2019-10-03 02:40:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-10-03 02:40:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 377 transitions. [2019-10-03 02:40:34,440 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 377 transitions. Word has length 150 [2019-10-03 02:40:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:34,440 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 377 transitions. [2019-10-03 02:40:34,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-03 02:40:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 377 transitions. [2019-10-03 02:40:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:40:34,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:34,442 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:34,443 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2073819428, now seen corresponding path program 1 times [2019-10-03 02:40:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:34,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:40:34,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:40:34,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:40:34,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-10-03 02:40:34,592 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [250], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [496], [498], [501], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [727], [730], [735], [738], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [833], [834], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-10-03 02:40:34,600 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:40:34,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:40:34,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:40:34,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:40:34,673 INFO L272 AbstractInterpreter]: Visited 83 different actions 108 times. Never merged. Never widened. Performed 912 root evaluator evaluations with a maximum evaluation depth of 9. Performed 912 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-10-03 02:40:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:34,673 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:40:34,838 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.37% of their original sizes. [2019-10-03 02:40:34,838 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:40:45,623 INFO L420 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2019-10-03 02:40:45,623 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:40:45,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:40:45,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [12] total 89 [2019-10-03 02:40:45,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:45,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-03 02:40:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-03 02:40:45,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5865, Unknown=0, NotChecked=0, Total=6162 [2019-10-03 02:40:45,629 INFO L87 Difference]: Start difference. First operand 341 states and 377 transitions. Second operand 79 states. [2019-10-03 02:41:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:14,596 INFO L93 Difference]: Finished difference Result 587 states and 658 transitions. [2019-10-03 02:41:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-03 02:41:14,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-10-03 02:41:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:14,599 INFO L225 Difference]: With dead ends: 587 [2019-10-03 02:41:14,599 INFO L226 Difference]: Without dead ends: 547 [2019-10-03 02:41:14,600 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=461, Invalid=9639, Unknown=0, NotChecked=0, Total=10100 [2019-10-03 02:41:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-03 02:41:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 474. [2019-10-03 02:41:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-03 02:41:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 525 transitions. [2019-10-03 02:41:14,638 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 525 transitions. Word has length 155 [2019-10-03 02:41:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:14,638 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 525 transitions. [2019-10-03 02:41:14,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-03 02:41:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 525 transitions. [2019-10-03 02:41:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:41:14,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:14,641 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:14,641 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash 223545200, now seen corresponding path program 1 times [2019-10-03 02:41:14,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:14,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:41:14,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:14,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:41:14,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:14,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:41:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:41:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:14,772 INFO L87 Difference]: Start difference. First operand 474 states and 525 transitions. Second operand 10 states. [2019-10-03 02:41:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:16,133 INFO L93 Difference]: Finished difference Result 706 states and 789 transitions. [2019-10-03 02:41:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:41:16,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-10-03 02:41:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:16,137 INFO L225 Difference]: With dead ends: 706 [2019-10-03 02:41:16,138 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:16,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:41:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 513. [2019-10-03 02:41:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-10-03 02:41:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 567 transitions. [2019-10-03 02:41:16,148 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 567 transitions. Word has length 158 [2019-10-03 02:41:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:16,148 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 567 transitions. [2019-10-03 02:41:16,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:41:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 567 transitions. [2019-10-03 02:41:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:41:16,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:16,151 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:16,151 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1882860318, now seen corresponding path program 1 times [2019-10-03 02:41:16,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 02:41:16,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:16,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:41:16,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2019-10-03 02:41:16,286 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [496], [498], [501], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [656], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [706], [708], [709], [727], [730], [735], [738], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [833], [834], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [861], [862], [863] [2019-10-03 02:41:16,290 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:41:16,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:41:16,319 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:41:16,349 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:41:16,350 INFO L272 AbstractInterpreter]: Visited 83 different actions 108 times. Never merged. Never widened. Performed 968 root evaluator evaluations with a maximum evaluation depth of 9. Performed 968 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 124 variables. [2019-10-03 02:41:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:16,350 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:41:16,474 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 77.37% of their original sizes. [2019-10-03 02:41:16,474 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:41:26,182 INFO L420 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2019-10-03 02:41:26,182 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:41:26,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:41:26,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [12] total 89 [2019-10-03 02:41:26,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:26,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-03 02:41:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-03 02:41:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=5862, Unknown=0, NotChecked=0, Total=6162 [2019-10-03 02:41:26,185 INFO L87 Difference]: Start difference. First operand 513 states and 567 transitions. Second operand 79 states. [2019-10-03 02:42:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:04,120 INFO L93 Difference]: Finished difference Result 610 states and 682 transitions. [2019-10-03 02:42:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-10-03 02:42:04,120 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-10-03 02:42:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:04,121 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:42:04,121 INFO L226 Difference]: Without dead ends: 570 [2019-10-03 02:42:04,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=464, Invalid=9636, Unknown=0, NotChecked=0, Total=10100 [2019-10-03 02:42:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-03 02:42:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 523. [2019-10-03 02:42:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-03 02:42:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 579 transitions. [2019-10-03 02:42:04,131 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 579 transitions. Word has length 155 [2019-10-03 02:42:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:04,132 INFO L475 AbstractCegarLoop]: Abstraction has 523 states and 579 transitions. [2019-10-03 02:42:04,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-03 02:42:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 579 transitions. [2019-10-03 02:42:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:42:04,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:04,135 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:04,135 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2140296462, now seen corresponding path program 1 times [2019-10-03 02:42:04,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:04,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:04,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:42:04,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:42:04,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:42:04,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-10-03 02:42:04,311 INFO L207 CegarAbsIntRunner]: [0], [5], [9], [11], [12], [13], [28], [31], [35], [41], [44], [80], [234], [237], [241], [242], [243], [247], [252], [258], [261], [267], [285], [297], [301], [304], [307], [310], [316], [334], [337], [340], [368], [373], [374], [376], [377], [378], [389], [393], [403], [406], [411], [414], [415], [418], [423], [424], [430], [436], [438], [440], [447], [449], [451], [454], [473], [477], [481], [490], [494], [509], [512], [517], [524], [526], [533], [535], [536], [561], [564], [569], [572], [573], [574], [575], [576], [577], [627], [630], [632], [635], [643], [646], [648], [651], [656], [658], [668], [671], [676], [687], [688], [689], [690], [691], [693], [697], [699], [702], [704], [708], [709], [753], [754], [799], [800], [801], [802], [803], [804], [807], [815], [816], [825], [826], [829], [830], [835], [836], [839], [840], [849], [850], [851], [852], [855], [856], [857], [858], [859], [860], [861], [862], [863] [2019-10-03 02:42:04,313 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:42:04,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:42:04,367 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:42:04,480 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:42:04,482 INFO L272 AbstractInterpreter]: Visited 76 different actions 171 times. Merged at 12 different actions 26 times. Never widened. Performed 1497 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1497 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Never found a fixpoint. Largest state had 123 variables. [2019-10-03 02:42:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:04,482 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:42:04,668 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 70.88% of their original sizes. [2019-10-03 02:42:04,668 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:42:13,916 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-10-03 02:42:13,917 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:42:13,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:42:13,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [15] total 85 [2019-10-03 02:42:13,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:13,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-03 02:42:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-03 02:42:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4916, Unknown=0, NotChecked=0, Total=5112 [2019-10-03 02:42:13,919 INFO L87 Difference]: Start difference. First operand 523 states and 579 transitions. Second operand 72 states. [2019-10-03 02:42:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:56,315 INFO L93 Difference]: Finished difference Result 594 states and 658 transitions. [2019-10-03 02:42:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-03 02:42:56,316 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 158 [2019-10-03 02:42:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:56,319 INFO L225 Difference]: With dead ends: 594 [2019-10-03 02:42:56,319 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:42:56,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=288, Invalid=7194, Unknown=0, NotChecked=0, Total=7482 [2019-10-03 02:42:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:42:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 574. [2019-10-03 02:42:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:42:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 637 transitions. [2019-10-03 02:42:56,338 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 637 transitions. Word has length 158 [2019-10-03 02:42:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:56,338 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 637 transitions. [2019-10-03 02:42:56,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-03 02:42:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 637 transitions. [2019-10-03 02:42:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:42:56,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:56,342 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:56,342 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1598398701, now seen corresponding path program 1 times [2019-10-03 02:42:56,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:56,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:56,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:42:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:42:56,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:56,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:42:56,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:42:56,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:56,471 INFO L87 Difference]: Start difference. First operand 574 states and 637 transitions. Second operand 5 states. [2019-10-03 02:42:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:56,487 INFO L93 Difference]: Finished difference Result 579 states and 634 transitions. [2019-10-03 02:42:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:56,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-03 02:42:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:56,490 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:42:56,490 INFO L226 Difference]: Without dead ends: 552 [2019-10-03 02:42:56,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-03 02:42:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2019-10-03 02:42:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-03 02:42:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 607 transitions. [2019-10-03 02:42:56,509 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 607 transitions. Word has length 158 [2019-10-03 02:42:56,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:56,509 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 607 transitions. [2019-10-03 02:42:56,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:42:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 607 transitions. [2019-10-03 02:42:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-03 02:42:56,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:56,518 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:56,518 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:56,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2027926138, now seen corresponding path program 1 times [2019-10-03 02:42:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:56,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:56,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:42:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:42:56,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:56,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:42:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:42:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:42:56,732 INFO L87 Difference]: Start difference. First operand 552 states and 607 transitions. Second operand 14 states. [2019-10-03 02:42:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:58,646 INFO L93 Difference]: Finished difference Result 627 states and 694 transitions. [2019-10-03 02:42:58,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 02:42:58,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 159 [2019-10-03 02:42:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:58,650 INFO L225 Difference]: With dead ends: 627 [2019-10-03 02:42:58,650 INFO L226 Difference]: Without dead ends: 536 [2019-10-03 02:42:58,651 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-03 02:42:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-03 02:42:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 448. [2019-10-03 02:42:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-03 02:42:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 486 transitions. [2019-10-03 02:42:58,663 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 486 transitions. Word has length 159 [2019-10-03 02:42:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:58,663 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 486 transitions. [2019-10-03 02:42:58,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:42:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 486 transitions. [2019-10-03 02:42:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-03 02:42:58,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:58,666 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:58,666 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -973879413, now seen corresponding path program 1 times [2019-10-03 02:42:58,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:58,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:42:58,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:42:58,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:58,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:42:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:42:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:58,819 INFO L87 Difference]: Start difference. First operand 448 states and 486 transitions. Second operand 12 states. [2019-10-03 02:42:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:58,973 INFO L93 Difference]: Finished difference Result 521 states and 574 transitions. [2019-10-03 02:42:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:42:58,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-10-03 02:42:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:58,977 INFO L225 Difference]: With dead ends: 521 [2019-10-03 02:42:58,977 INFO L226 Difference]: Without dead ends: 456 [2019-10-03 02:42:58,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:42:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-03 02:42:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 436. [2019-10-03 02:42:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-10-03 02:42:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 470 transitions. [2019-10-03 02:42:58,989 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 470 transitions. Word has length 161 [2019-10-03 02:42:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:58,990 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 470 transitions. [2019-10-03 02:42:58,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:42:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 470 transitions. [2019-10-03 02:42:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-03 02:42:58,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:58,994 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:58,994 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1877028, now seen corresponding path program 1 times [2019-10-03 02:42:58,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:58,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:58,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:58,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 02:42:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:59,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:42:59,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:59,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:42:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:42:59,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:59,188 INFO L87 Difference]: Start difference. First operand 436 states and 470 transitions. Second operand 12 states. [2019-10-03 02:42:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:59,437 INFO L93 Difference]: Finished difference Result 519 states and 572 transitions. [2019-10-03 02:42:59,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:42:59,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-10-03 02:42:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:59,439 INFO L225 Difference]: With dead ends: 519 [2019-10-03 02:42:59,440 INFO L226 Difference]: Without dead ends: 466 [2019-10-03 02:42:59,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:42:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-03 02:42:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 444. [2019-10-03 02:42:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-10-03 02:42:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 478 transitions. [2019-10-03 02:42:59,450 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 478 transitions. Word has length 166 [2019-10-03 02:42:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:59,450 INFO L475 AbstractCegarLoop]: Abstraction has 444 states and 478 transitions. [2019-10-03 02:42:59,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:42:59,450 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 478 transitions. [2019-10-03 02:42:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-03 02:42:59,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:59,453 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:59,454 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1898802169, now seen corresponding path program 1 times [2019-10-03 02:42:59,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:59,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 02:42:59,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:59,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:42:59,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:59,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:42:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:42:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:42:59,605 INFO L87 Difference]: Start difference. First operand 444 states and 478 transitions. Second operand 11 states. [2019-10-03 02:42:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:59,654 INFO L93 Difference]: Finished difference Result 366 states and 392 transitions. [2019-10-03 02:42:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:59,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 166 [2019-10-03 02:42:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:59,655 INFO L225 Difference]: With dead ends: 366 [2019-10-03 02:42:59,655 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:42:59,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:42:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:42:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:42:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:42:59,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2019-10-03 02:42:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:59,657 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:42:59,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:42:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:42:59,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:42:59,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:42:59 BoogieIcfgContainer [2019-10-03 02:42:59,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:42:59,667 INFO L168 Benchmark]: Toolchain (without parser) took 327259.29 ms. Allocated memory was 131.1 MB in the beginning and 644.3 MB in the end (delta: 513.3 MB). Free memory was 84.2 MB in the beginning and 444.4 MB in the end (delta: -360.2 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,667 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.83 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 84.0 MB in the beginning and 164.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,672 INFO L168 Benchmark]: Boogie Preprocessor took 86.62 ms. Allocated memory is still 200.3 MB. Free memory was 164.1 MB in the beginning and 160.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,673 INFO L168 Benchmark]: RCFGBuilder took 1186.88 ms. Allocated memory was 200.3 MB in the beginning and 220.2 MB in the end (delta: 19.9 MB). Free memory was 160.8 MB in the beginning and 190.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,675 INFO L168 Benchmark]: TraceAbstraction took 325197.36 ms. Allocated memory was 220.2 MB in the beginning and 644.3 MB in the end (delta: 424.1 MB). Free memory was 189.0 MB in the beginning and 444.4 MB in the end (delta: -255.4 MB). Peak memory consumption was 168.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:42:59,685 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.83 ms. Allocated memory was 131.1 MB in the beginning and 200.3 MB in the end (delta: 69.2 MB). Free memory was 84.0 MB in the beginning and 164.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.62 ms. Allocated memory is still 200.3 MB. Free memory was 164.1 MB in the beginning and 160.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1186.88 ms. Allocated memory was 200.3 MB in the beginning and 220.2 MB in the end (delta: 19.9 MB). Free memory was 160.8 MB in the beginning and 190.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 325197.36 ms. Allocated memory was 220.2 MB in the beginning and 644.3 MB in the end (delta: 424.1 MB). Free memory was 189.0 MB in the beginning and 444.4 MB in the end (delta: -255.4 MB). Peak memory consumption was 168.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 309 locations, 1 error locations. SAFE Result, 325.1s OverallTime, 55 OverallIterations, 2 TraceHistogramMax, 255.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17510 SDtfs, 12009 SDslu, 74266 SDs, 0 SdLazy, 35598 SolverSat, 2340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1430 GetRequests, 469 SyntacticMatches, 10 SemanticMatches, 951 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16816 ImplicationChecksByTransitivity, 76.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 5 AbstIntIterations, 5 AbstIntStrong, 0.9674287400846289 AbsIntWeakeningRatio, 2.2332896461336826 AbsIntAvgWeakeningVarsNumRemoved, 26.128440366972477 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 55 MinimizatonAttempts, 2530 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 4527 NumberOfCodeBlocks, 4527 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4472 ConstructedInterpolants, 0 QuantifiedInterpolants, 819897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 50 PerfectInterpolantSequences, 367/382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...