java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:48,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:48,282 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:48,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:48,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:48,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:48,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:48,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:48,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:48,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:48,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:48,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:48,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:48,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:48,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:48,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:48,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:48,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:48,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:48,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:48,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:48,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:48,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:48,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:48,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:48,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:48,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:48,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:48,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:48,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:48,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:48,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:48,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:48,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:48,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:48,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:48,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:48,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:48,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:48,338 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:48,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:48,340 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:59:48,364 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:48,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:48,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:48,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:48,366 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:48,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:48,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:48,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:48,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:48,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:48,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:48,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:48,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:48,368 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:48,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:48,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:48,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:48,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:48,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:48,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:48,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:48,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:48,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:48,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:48,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:48,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:48,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:48,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:48,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:48,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:48,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:48,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:48,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:48,440 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:48,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-09-20 12:59:48,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/905c898c6/572b3315fcca4e409b7cc6849c43f101/FLAGf45795dec [2019-09-20 12:59:49,126 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:49,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-09-20 12:59:49,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/905c898c6/572b3315fcca4e409b7cc6849c43f101/FLAGf45795dec [2019-09-20 12:59:49,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/905c898c6/572b3315fcca4e409b7cc6849c43f101 [2019-09-20 12:59:49,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:49,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:49,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:49,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:49,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:49,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:49" (1/1) ... [2019-09-20 12:59:49,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@add5982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:49, skipping insertion in model container [2019-09-20 12:59:49,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:49" (1/1) ... [2019-09-20 12:59:49,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:49,453 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:50,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:50,077 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:50,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:50,233 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:50,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50 WrapperNode [2019-09-20 12:59:50,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:50,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:50,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:50,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:50,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (1/1) ... [2019-09-20 12:59:50,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:50,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:50,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:50,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:50,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (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-09-20 12:59:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 12:59:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 12:59:50,486 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-09-20 12:59:50,487 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-09-20 12:59:50,488 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-09-20 12:59:50,488 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-09-20 12:59:50,489 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-09-20 12:59:50,489 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-09-20 12:59:50,490 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-09-20 12:59:50,492 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-09-20 12:59:50,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-09-20 12:59:50,492 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 12:59:50,493 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 12:59:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 12:59:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 12:59:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 12:59:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 12:59:50,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-20 12:59:50,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:59:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 12:59:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 12:59:50,495 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-09-20 12:59:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-09-20 12:59:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-09-20 12:59:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-09-20 12:59:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-09-20 12:59:50,496 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-09-20 12:59:50,497 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-09-20 12:59:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-09-20 12:59:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-09-20 12:59:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-09-20 12:59:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 12:59:50,498 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 12:59:50,499 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:50,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:51,046 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,169 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 12:59:51,170 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 12:59:51,176 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,239 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 12:59:51,240 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 12:59:51,272 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,302 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 12:59:51,302 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 12:59:51,398 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,475 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-09-20 12:59:51,475 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 12:59:51,475 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 12:59:51,503 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,709 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-09-20 12:59:51,709 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-09-20 12:59:51,710 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,746 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-20 12:59:51,747 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-20 12:59:51,775 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:51,792 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 12:59:51,792 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 12:59:51,797 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,004 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-09-20 12:59:52,004 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-09-20 12:59:52,019 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,026 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:52,026 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:52,047 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:52,047 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:59:52,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:52 BoogieIcfgContainer [2019-09-20 12:59:52,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:52,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:52,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:52,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:52,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:49" (1/3) ... [2019-09-20 12:59:52,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea5e8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:52, skipping insertion in model container [2019-09-20 12:59:52,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:50" (2/3) ... [2019-09-20 12:59:52,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea5e8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:52, skipping insertion in model container [2019-09-20 12:59:52,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:52" (3/3) ... [2019-09-20 12:59:52,059 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-09-20 12:59:52,071 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:52,083 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:52,103 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:52,152 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:52,153 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:52,153 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:52,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:52,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:52,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:52,153 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:52,154 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:52,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states. [2019-09-20 12:59:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:52,205 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,207 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:52,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1001295975, now seen corresponding path program 1 times [2019-09-20 12:59:52,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:52,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:52,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:52,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:52,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:52,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:52,549 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 3 states. [2019-09-20 12:59:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:52,777 INFO L93 Difference]: Finished difference Result 887 states and 1373 transitions. [2019-09-20 12:59:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:52,800 INFO L225 Difference]: With dead ends: 887 [2019-09-20 12:59:52,800 INFO L226 Difference]: Without dead ends: 507 [2019-09-20 12:59:52,812 INFO L636 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-09-20 12:59:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-20 12:59:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-09-20 12:59:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-09-20 12:59:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2019-09-20 12:59:52,931 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2019-09-20 12:59:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:52,932 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2019-09-20 12:59:52,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2019-09-20 12:59:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:59:52,935 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:52,935 INFO L407 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] [2019-09-20 12:59:52,935 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1234723898, now seen corresponding path program 1 times [2019-09-20 12:59:52,937 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:53,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:53,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:53,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:53,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:53,201 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand 3 states. [2019-09-20 12:59:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:53,492 INFO L93 Difference]: Finished difference Result 789 states and 1117 transitions. [2019-09-20 12:59:53,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:53,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 12:59:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:53,508 INFO L225 Difference]: With dead ends: 789 [2019-09-20 12:59:53,509 INFO L226 Difference]: Without dead ends: 670 [2019-09-20 12:59:53,512 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09-20 12:59:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-20 12:59:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 652. [2019-09-20 12:59:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-09-20 12:59:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 931 transitions. [2019-09-20 12:59:53,590 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 931 transitions. Word has length 25 [2019-09-20 12:59:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:53,591 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 931 transitions. [2019-09-20 12:59:53,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 931 transitions. [2019-09-20 12:59:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:59:53,601 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:53,601 INFO L407 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-09-20 12:59:53,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1338407833, now seen corresponding path program 1 times [2019-09-20 12:59:53,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:53,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:53,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:53,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:53,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:53,751 INFO L87 Difference]: Start difference. First operand 652 states and 931 transitions. Second operand 3 states. [2019-09-20 12:59:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:53,816 INFO L93 Difference]: Finished difference Result 995 states and 1378 transitions. [2019-09-20 12:59:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:53,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 12:59:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:53,824 INFO L225 Difference]: With dead ends: 995 [2019-09-20 12:59:53,824 INFO L226 Difference]: Without dead ends: 819 [2019-09-20 12:59:53,826 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-09-20 12:59:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-20 12:59:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 767. [2019-09-20 12:59:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-09-20 12:59:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1091 transitions. [2019-09-20 12:59:53,902 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1091 transitions. Word has length 30 [2019-09-20 12:59:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:53,902 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1091 transitions. [2019-09-20 12:59:53,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1091 transitions. [2019-09-20 12:59:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:53,905 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:53,906 INFO L407 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] [2019-09-20 12:59:53,906 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:53,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 817062638, now seen corresponding path program 1 times [2019-09-20 12:59:53,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:53,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:53,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:53,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:53,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:53,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:53,972 INFO L87 Difference]: Start difference. First operand 767 states and 1091 transitions. Second operand 3 states. [2019-09-20 12:59:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:54,171 INFO L93 Difference]: Finished difference Result 1424 states and 2092 transitions. [2019-09-20 12:59:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:54,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 12:59:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:54,182 INFO L225 Difference]: With dead ends: 1424 [2019-09-20 12:59:54,183 INFO L226 Difference]: Without dead ends: 1160 [2019-09-20 12:59:54,185 INFO L636 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-09-20 12:59:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-09-20 12:59:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 899. [2019-09-20 12:59:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-20 12:59:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1323 transitions. [2019-09-20 12:59:54,261 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1323 transitions. Word has length 31 [2019-09-20 12:59:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:54,262 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1323 transitions. [2019-09-20 12:59:54,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1323 transitions. [2019-09-20 12:59:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:54,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:54,265 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:54,265 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash -679253739, now seen corresponding path program 1 times [2019-09-20 12:59:54,266 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:54,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:54,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:54,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:54,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:54,428 INFO L87 Difference]: Start difference. First operand 899 states and 1323 transitions. Second operand 5 states. [2019-09-20 12:59:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,338 INFO L93 Difference]: Finished difference Result 1562 states and 2305 transitions. [2019-09-20 12:59:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:55,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-09-20 12:59:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,346 INFO L225 Difference]: With dead ends: 1562 [2019-09-20 12:59:55,346 INFO L226 Difference]: Without dead ends: 984 [2019-09-20 12:59:55,349 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-20 12:59:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 887. [2019-09-20 12:59:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-20 12:59:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1299 transitions. [2019-09-20 12:59:55,411 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1299 transitions. Word has length 32 [2019-09-20 12:59:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,413 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1299 transitions. [2019-09-20 12:59:55,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1299 transitions. [2019-09-20 12:59:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 12:59:55,418 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,418 INFO L407 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] [2019-09-20 12:59:55,419 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash 891535335, now seen corresponding path program 1 times [2019-09-20 12:59:55,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:55,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,552 INFO L87 Difference]: Start difference. First operand 887 states and 1299 transitions. Second operand 3 states. [2019-09-20 12:59:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,663 INFO L93 Difference]: Finished difference Result 890 states and 1301 transitions. [2019-09-20 12:59:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 12:59:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,671 INFO L225 Difference]: With dead ends: 890 [2019-09-20 12:59:55,671 INFO L226 Difference]: Without dead ends: 886 [2019-09-20 12:59:55,672 INFO L636 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-09-20 12:59:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-09-20 12:59:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-09-20 12:59:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-09-20 12:59:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1296 transitions. [2019-09-20 12:59:55,727 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1296 transitions. Word has length 36 [2019-09-20 12:59:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,727 INFO L475 AbstractCegarLoop]: Abstraction has 886 states and 1296 transitions. [2019-09-20 12:59:55,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1296 transitions. [2019-09-20 12:59:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:55,731 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,731 INFO L407 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] [2019-09-20 12:59:55,732 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,732 INFO L82 PathProgramCache]: Analyzing trace with hash 975145180, now seen corresponding path program 1 times [2019-09-20 12:59:55,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:55,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,794 INFO L87 Difference]: Start difference. First operand 886 states and 1296 transitions. Second operand 3 states. [2019-09-20 12:59:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,852 INFO L93 Difference]: Finished difference Result 1274 states and 1815 transitions. [2019-09-20 12:59:55,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 12:59:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,860 INFO L225 Difference]: With dead ends: 1274 [2019-09-20 12:59:55,860 INFO L226 Difference]: Without dead ends: 1015 [2019-09-20 12:59:55,862 INFO L636 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-09-20 12:59:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-20 12:59:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 872. [2019-09-20 12:59:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-20 12:59:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1238 transitions. [2019-09-20 12:59:55,923 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1238 transitions. Word has length 39 [2019-09-20 12:59:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,923 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1238 transitions. [2019-09-20 12:59:55,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1238 transitions. [2019-09-20 12:59:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 12:59:55,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,926 INFO L407 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-09-20 12:59:55,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693992, now seen corresponding path program 1 times [2019-09-20 12:59:55,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:55,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,000 INFO L87 Difference]: Start difference. First operand 872 states and 1238 transitions. Second operand 3 states. [2019-09-20 12:59:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,059 INFO L93 Difference]: Finished difference Result 972 states and 1362 transitions. [2019-09-20 12:59:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-20 12:59:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,066 INFO L225 Difference]: With dead ends: 972 [2019-09-20 12:59:56,068 INFO L226 Difference]: Without dead ends: 954 [2019-09-20 12:59:56,069 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09-20 12:59:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-20 12:59:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 892. [2019-09-20 12:59:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-20 12:59:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1264 transitions. [2019-09-20 12:59:56,125 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1264 transitions. Word has length 40 [2019-09-20 12:59:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,127 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1264 transitions. [2019-09-20 12:59:56,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1264 transitions. [2019-09-20 12:59:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 12:59:56,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,132 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:56,132 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1915119306, now seen corresponding path program 1 times [2019-09-20 12:59:56,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,212 INFO L87 Difference]: Start difference. First operand 892 states and 1264 transitions. Second operand 3 states. [2019-09-20 12:59:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,266 INFO L93 Difference]: Finished difference Result 1167 states and 1639 transitions. [2019-09-20 12:59:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 12:59:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,274 INFO L225 Difference]: With dead ends: 1167 [2019-09-20 12:59:56,275 INFO L226 Difference]: Without dead ends: 925 [2019-09-20 12:59:56,276 INFO L636 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-09-20 12:59:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-09-20 12:59:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 892. [2019-09-20 12:59:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-20 12:59:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1263 transitions. [2019-09-20 12:59:56,334 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1263 transitions. Word has length 46 [2019-09-20 12:59:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,334 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1263 transitions. [2019-09-20 12:59:56,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1263 transitions. [2019-09-20 12:59:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:56,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,339 INFO L407 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] [2019-09-20 12:59:56,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2102488102, now seen corresponding path program 1 times [2019-09-20 12:59:56,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:56,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:56,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:56,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:56,414 INFO L87 Difference]: Start difference. First operand 892 states and 1263 transitions. Second operand 4 states. [2019-09-20 12:59:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,825 INFO L93 Difference]: Finished difference Result 1014 states and 1409 transitions. [2019-09-20 12:59:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:56,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-09-20 12:59:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,830 INFO L225 Difference]: With dead ends: 1014 [2019-09-20 12:59:56,831 INFO L226 Difference]: Without dead ends: 785 [2019-09-20 12:59:56,832 INFO L636 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-09-20 12:59:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-09-20 12:59:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 751. [2019-09-20 12:59:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-20 12:59:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1056 transitions. [2019-09-20 12:59:56,893 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1056 transitions. Word has length 47 [2019-09-20 12:59:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,893 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1056 transitions. [2019-09-20 12:59:56,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1056 transitions. [2019-09-20 12:59:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:56,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,898 INFO L407 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] [2019-09-20 12:59:56,898 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,899 INFO L82 PathProgramCache]: Analyzing trace with hash -18672278, now seen corresponding path program 1 times [2019-09-20 12:59:56,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,981 INFO L87 Difference]: Start difference. First operand 751 states and 1056 transitions. Second operand 3 states. [2019-09-20 12:59:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,046 INFO L93 Difference]: Finished difference Result 871 states and 1204 transitions. [2019-09-20 12:59:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-20 12:59:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,053 INFO L225 Difference]: With dead ends: 871 [2019-09-20 12:59:57,053 INFO L226 Difference]: Without dead ends: 775 [2019-09-20 12:59:57,055 INFO L636 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-09-20 12:59:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-20 12:59:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 750. [2019-09-20 12:59:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-20 12:59:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2019-09-20 12:59:57,122 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 47 [2019-09-20 12:59:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,122 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2019-09-20 12:59:57,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2019-09-20 12:59:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 12:59:57,127 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,127 INFO L407 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] [2019-09-20 12:59:57,127 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash -753875003, now seen corresponding path program 1 times [2019-09-20 12:59:57,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,194 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand 3 states. [2019-09-20 12:59:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,316 INFO L93 Difference]: Finished difference Result 938 states and 1298 transitions. [2019-09-20 12:59:57,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-20 12:59:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,322 INFO L225 Difference]: With dead ends: 938 [2019-09-20 12:59:57,322 INFO L226 Difference]: Without dead ends: 928 [2019-09-20 12:59:57,323 INFO L636 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-09-20 12:59:57,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-20 12:59:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 825. [2019-09-20 12:59:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-09-20 12:59:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1138 transitions. [2019-09-20 12:59:57,371 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1138 transitions. Word has length 48 [2019-09-20 12:59:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,373 INFO L475 AbstractCegarLoop]: Abstraction has 825 states and 1138 transitions. [2019-09-20 12:59:57,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1138 transitions. [2019-09-20 12:59:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:57,376 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,376 INFO L407 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-09-20 12:59:57,376 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1451417877, now seen corresponding path program 1 times [2019-09-20 12:59:57,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:57,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:57,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:57,456 INFO L87 Difference]: Start difference. First operand 825 states and 1138 transitions. Second operand 8 states. [2019-09-20 12:59:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,612 INFO L93 Difference]: Finished difference Result 851 states and 1172 transitions. [2019-09-20 12:59:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:57,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 12:59:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,618 INFO L225 Difference]: With dead ends: 851 [2019-09-20 12:59:57,618 INFO L226 Difference]: Without dead ends: 847 [2019-09-20 12:59:57,619 INFO L636 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-09-20 12:59:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-20 12:59:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 844. [2019-09-20 12:59:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-09-20 12:59:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1165 transitions. [2019-09-20 12:59:57,672 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1165 transitions. Word has length 49 [2019-09-20 12:59:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,672 INFO L475 AbstractCegarLoop]: Abstraction has 844 states and 1165 transitions. [2019-09-20 12:59:57,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1165 transitions. [2019-09-20 12:59:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:57,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,676 INFO L407 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-09-20 12:59:57,676 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1451694707, now seen corresponding path program 1 times [2019-09-20 12:59:57,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:57,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:57,746 INFO L87 Difference]: Start difference. First operand 844 states and 1165 transitions. Second operand 8 states. [2019-09-20 12:59:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,864 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2019-09-20 12:59:57,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:57,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 12:59:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,870 INFO L225 Difference]: With dead ends: 886 [2019-09-20 12:59:57,871 INFO L226 Difference]: Without dead ends: 865 [2019-09-20 12:59:57,872 INFO L636 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-09-20 12:59:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-20 12:59:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 864. [2019-09-20 12:59:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-09-20 12:59:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1189 transitions. [2019-09-20 12:59:57,950 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1189 transitions. Word has length 49 [2019-09-20 12:59:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,951 INFO L475 AbstractCegarLoop]: Abstraction has 864 states and 1189 transitions. [2019-09-20 12:59:57,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1189 transitions. [2019-09-20 12:59:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:57,954 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,954 INFO L407 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] [2019-09-20 12:59:57,954 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1035590368, now seen corresponding path program 1 times [2019-09-20 12:59:57,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,998 INFO L87 Difference]: Start difference. First operand 864 states and 1189 transitions. Second operand 3 states. [2019-09-20 12:59:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,109 INFO L93 Difference]: Finished difference Result 1081 states and 1472 transitions. [2019-09-20 12:59:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 12:59:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,116 INFO L225 Difference]: With dead ends: 1081 [2019-09-20 12:59:58,116 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 12:59:58,118 INFO L636 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-09-20 12:59:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 12:59:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 944. [2019-09-20 12:59:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-20 12:59:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1281 transitions. [2019-09-20 12:59:58,170 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1281 transitions. Word has length 50 [2019-09-20 12:59:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,170 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1281 transitions. [2019-09-20 12:59:58,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1281 transitions. [2019-09-20 12:59:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:58,174 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,174 INFO L407 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] [2019-09-20 12:59:58,175 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1411925024, now seen corresponding path program 1 times [2019-09-20 12:59:58,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:58,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:58,216 INFO L87 Difference]: Start difference. First operand 944 states and 1281 transitions. Second operand 4 states. [2019-09-20 12:59:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,275 INFO L93 Difference]: Finished difference Result 966 states and 1303 transitions. [2019-09-20 12:59:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:58,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 12:59:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,281 INFO L225 Difference]: With dead ends: 966 [2019-09-20 12:59:58,281 INFO L226 Difference]: Without dead ends: 944 [2019-09-20 12:59:58,282 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-20 12:59:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2019-09-20 12:59:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-20 12:59:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1280 transitions. [2019-09-20 12:59:58,329 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1280 transitions. Word has length 50 [2019-09-20 12:59:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,329 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1280 transitions. [2019-09-20 12:59:58,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1280 transitions. [2019-09-20 12:59:58,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:58,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,333 INFO L407 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] [2019-09-20 12:59:58,333 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 888897566, now seen corresponding path program 1 times [2019-09-20 12:59:58,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:59:58,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:58,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:58,398 INFO L87 Difference]: Start difference. First operand 944 states and 1280 transitions. Second operand 7 states. [2019-09-20 12:59:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,571 INFO L93 Difference]: Finished difference Result 1110 states and 1554 transitions. [2019-09-20 12:59:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:59,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-09-20 12:59:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,578 INFO L225 Difference]: With dead ends: 1110 [2019-09-20 12:59:59,578 INFO L226 Difference]: Without dead ends: 1016 [2019-09-20 12:59:59,579 INFO L636 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-09-20 12:59:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-09-20 12:59:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 875. [2019-09-20 12:59:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-09-20 12:59:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1181 transitions. [2019-09-20 12:59:59,634 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1181 transitions. Word has length 50 [2019-09-20 12:59:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,634 INFO L475 AbstractCegarLoop]: Abstraction has 875 states and 1181 transitions. [2019-09-20 12:59:59,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1181 transitions. [2019-09-20 12:59:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 12:59:59,638 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,638 INFO L407 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] [2019-09-20 12:59:59,638 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -200005759, now seen corresponding path program 1 times [2019-09-20 12:59:59,639 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 12:59:59,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:59:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:59:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:59:59,928 INFO L87 Difference]: Start difference. First operand 875 states and 1181 transitions. Second operand 15 states. [2019-09-20 13:00:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,178 INFO L93 Difference]: Finished difference Result 1054 states and 1469 transitions. [2019-09-20 13:00:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-20 13:00:03,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-09-20 13:00:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,184 INFO L225 Difference]: With dead ends: 1054 [2019-09-20 13:00:03,185 INFO L226 Difference]: Without dead ends: 1033 [2019-09-20 13:00:03,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:00:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-09-20 13:00:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 876. [2019-09-20 13:00:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-20 13:00:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1182 transitions. [2019-09-20 13:00:03,245 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1182 transitions. Word has length 50 [2019-09-20 13:00:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,246 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1182 transitions. [2019-09-20 13:00:03,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:00:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1182 transitions. [2019-09-20 13:00:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:00:03,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,252 INFO L407 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] [2019-09-20 13:00:03,253 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,253 INFO L82 PathProgramCache]: Analyzing trace with hash -594952383, now seen corresponding path program 1 times [2019-09-20 13:00:03,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:03,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:03,403 INFO L87 Difference]: Start difference. First operand 876 states and 1182 transitions. Second operand 10 states. [2019-09-20 13:00:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:05,947 INFO L93 Difference]: Finished difference Result 1142 states and 1589 transitions. [2019-09-20 13:00:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:05,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-20 13:00:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:05,955 INFO L225 Difference]: With dead ends: 1142 [2019-09-20 13:00:05,955 INFO L226 Difference]: Without dead ends: 1121 [2019-09-20 13:00:05,957 INFO L636 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-09-20 13:00:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-09-20 13:00:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 880. [2019-09-20 13:00:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2019-09-20 13:00:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1184 transitions. [2019-09-20 13:00:06,015 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1184 transitions. Word has length 50 [2019-09-20 13:00:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,016 INFO L475 AbstractCegarLoop]: Abstraction has 880 states and 1184 transitions. [2019-09-20 13:00:06,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1184 transitions. [2019-09-20 13:00:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:06,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,021 INFO L407 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-09-20 13:00:06,022 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1728648689, now seen corresponding path program 1 times [2019-09-20 13:00:06,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:06,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:06,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:06,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:06,084 INFO L87 Difference]: Start difference. First operand 880 states and 1184 transitions. Second operand 3 states. [2019-09-20 13:00:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,185 INFO L93 Difference]: Finished difference Result 905 states and 1212 transitions. [2019-09-20 13:00:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:06,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-20 13:00:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,192 INFO L225 Difference]: With dead ends: 905 [2019-09-20 13:00:06,192 INFO L226 Difference]: Without dead ends: 900 [2019-09-20 13:00:06,193 INFO L636 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-09-20 13:00:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-20 13:00:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-09-20 13:00:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-20 13:00:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1203 transitions. [2019-09-20 13:00:06,253 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1203 transitions. Word has length 52 [2019-09-20 13:00:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,254 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1203 transitions. [2019-09-20 13:00:06,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1203 transitions. [2019-09-20 13:00:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:06,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,258 INFO L407 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-09-20 13:00:06,258 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2025775123, now seen corresponding path program 1 times [2019-09-20 13:00:06,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:06,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:06,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:06,310 INFO L87 Difference]: Start difference. First operand 896 states and 1203 transitions. Second operand 3 states. [2019-09-20 13:00:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,448 INFO L93 Difference]: Finished difference Result 1109 states and 1487 transitions. [2019-09-20 13:00:06,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:06,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:00:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,453 INFO L225 Difference]: With dead ends: 1109 [2019-09-20 13:00:06,453 INFO L226 Difference]: Without dead ends: 868 [2019-09-20 13:00:06,455 INFO L636 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-09-20 13:00:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-20 13:00:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2019-09-20 13:00:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:00:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1166 transitions. [2019-09-20 13:00:06,502 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1166 transitions. Word has length 54 [2019-09-20 13:00:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,502 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1166 transitions. [2019-09-20 13:00:06,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1166 transitions. [2019-09-20 13:00:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:06,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,507 INFO L407 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-09-20 13:00:06,507 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907901, now seen corresponding path program 1 times [2019-09-20 13:00:06,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:06,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:00:06,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:00:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:00:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:06,643 INFO L87 Difference]: Start difference. First operand 868 states and 1166 transitions. Second operand 13 states. [2019-09-20 13:00:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:08,631 INFO L93 Difference]: Finished difference Result 903 states and 1205 transitions. [2019-09-20 13:00:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:00:08,631 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-09-20 13:00:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:08,636 INFO L225 Difference]: With dead ends: 903 [2019-09-20 13:00:08,637 INFO L226 Difference]: Without dead ends: 897 [2019-09-20 13:00:08,638 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:00:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-20 13:00:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 868. [2019-09-20 13:00:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:00:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1165 transitions. [2019-09-20 13:00:08,689 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1165 transitions. Word has length 53 [2019-09-20 13:00:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:08,690 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1165 transitions. [2019-09-20 13:00:08,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:00:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1165 transitions. [2019-09-20 13:00:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:08,693 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:08,693 INFO L407 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-09-20 13:00:08,694 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1608320713, now seen corresponding path program 1 times [2019-09-20 13:00:08,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:08,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:08,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:08,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:08,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:08,811 INFO L87 Difference]: Start difference. First operand 868 states and 1165 transitions. Second operand 10 states. [2019-09-20 13:00:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:11,319 INFO L93 Difference]: Finished difference Result 1116 states and 1551 transitions. [2019-09-20 13:00:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:11,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-09-20 13:00:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:11,326 INFO L225 Difference]: With dead ends: 1116 [2019-09-20 13:00:11,326 INFO L226 Difference]: Without dead ends: 1110 [2019-09-20 13:00:11,327 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 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-09-20 13:00:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-09-20 13:00:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 868. [2019-09-20 13:00:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-09-20 13:00:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1164 transitions. [2019-09-20 13:00:11,390 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1164 transitions. Word has length 53 [2019-09-20 13:00:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:11,390 INFO L475 AbstractCegarLoop]: Abstraction has 868 states and 1164 transitions. [2019-09-20 13:00:11,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1164 transitions. [2019-09-20 13:00:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:11,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:11,394 INFO L407 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-09-20 13:00:11,394 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1530606906, now seen corresponding path program 1 times [2019-09-20 13:00:11,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:11,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:11,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:11,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:11,521 INFO L87 Difference]: Start difference. First operand 868 states and 1164 transitions. Second operand 11 states. [2019-09-20 13:00:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:12,838 INFO L93 Difference]: Finished difference Result 891 states and 1188 transitions. [2019-09-20 13:00:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:12,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-20 13:00:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:12,844 INFO L225 Difference]: With dead ends: 891 [2019-09-20 13:00:12,844 INFO L226 Difference]: Without dead ends: 867 [2019-09-20 13:00:12,845 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-09-20 13:00:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2019-09-20 13:00:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-09-20 13:00:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1162 transitions. [2019-09-20 13:00:12,895 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1162 transitions. Word has length 52 [2019-09-20 13:00:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:12,895 INFO L475 AbstractCegarLoop]: Abstraction has 867 states and 1162 transitions. [2019-09-20 13:00:12,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1162 transitions. [2019-09-20 13:00:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:12,899 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:12,899 INFO L407 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-09-20 13:00:12,899 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1177776774, now seen corresponding path program 1 times [2019-09-20 13:00:12,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:12,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:12,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:12,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:12,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:12,948 INFO L87 Difference]: Start difference. First operand 867 states and 1162 transitions. Second operand 5 states. [2019-09-20 13:00:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,526 INFO L93 Difference]: Finished difference Result 879 states and 1173 transitions. [2019-09-20 13:00:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:13,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-20 13:00:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,532 INFO L225 Difference]: With dead ends: 879 [2019-09-20 13:00:13,532 INFO L226 Difference]: Without dead ends: 844 [2019-09-20 13:00:13,533 INFO L636 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-09-20 13:00:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-09-20 13:00:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2019-09-20 13:00:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:00:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1130 transitions. [2019-09-20 13:00:13,586 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1130 transitions. Word has length 52 [2019-09-20 13:00:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,587 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1130 transitions. [2019-09-20 13:00:13,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1130 transitions. [2019-09-20 13:00:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:13,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,590 INFO L407 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-09-20 13:00:13,591 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1155447028, now seen corresponding path program 1 times [2019-09-20 13:00:13,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-20 13:00:13,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:00:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:00:13,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:13,745 INFO L87 Difference]: Start difference. First operand 838 states and 1130 transitions. Second operand 13 states. [2019-09-20 13:00:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,543 INFO L93 Difference]: Finished difference Result 871 states and 1166 transitions. [2019-09-20 13:00:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:00:15,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-09-20 13:00:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,550 INFO L225 Difference]: With dead ends: 871 [2019-09-20 13:00:15,550 INFO L226 Difference]: Without dead ends: 865 [2019-09-20 13:00:15,551 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-09-20 13:00:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-09-20 13:00:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 838. [2019-09-20 13:00:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:00:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-09-20 13:00:15,618 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 54 [2019-09-20 13:00:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,619 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-09-20 13:00:15,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:00:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-09-20 13:00:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:15,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,623 INFO L407 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-09-20 13:00:15,623 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1041344956, now seen corresponding path program 1 times [2019-09-20 13:00:15,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:15,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:15,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:15,759 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 9 states. [2019-09-20 13:00:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,608 INFO L93 Difference]: Finished difference Result 1133 states and 1567 transitions. [2019-09-20 13:00:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:00:17,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-09-20 13:00:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,613 INFO L225 Difference]: With dead ends: 1133 [2019-09-20 13:00:17,613 INFO L226 Difference]: Without dead ends: 1083 [2019-09-20 13:00:17,614 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2019-09-20 13:00:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 847. [2019-09-20 13:00:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-09-20 13:00:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1153 transitions. [2019-09-20 13:00:17,673 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1153 transitions. Word has length 54 [2019-09-20 13:00:17,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,674 INFO L475 AbstractCegarLoop]: Abstraction has 847 states and 1153 transitions. [2019-09-20 13:00:17,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1153 transitions. [2019-09-20 13:00:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:00:17,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,677 INFO L407 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-09-20 13:00:17,677 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1771271244, now seen corresponding path program 1 times [2019-09-20 13:00:17,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:17,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:17,772 INFO L87 Difference]: Start difference. First operand 847 states and 1153 transitions. Second operand 9 states. [2019-09-20 13:00:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,992 INFO L93 Difference]: Finished difference Result 874 states and 1183 transitions. [2019-09-20 13:00:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:17,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:00:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,997 INFO L225 Difference]: With dead ends: 874 [2019-09-20 13:00:17,997 INFO L226 Difference]: Without dead ends: 838 [2019-09-20 13:00:17,998 INFO L636 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-09-20 13:00:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-20 13:00:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-20 13:00:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-20 13:00:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1129 transitions. [2019-09-20 13:00:18,049 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1129 transitions. Word has length 55 [2019-09-20 13:00:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,049 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1129 transitions. [2019-09-20 13:00:18,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1129 transitions. [2019-09-20 13:00:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:00:18,053 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,053 INFO L407 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-09-20 13:00:18,053 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 41202246, now seen corresponding path program 1 times [2019-09-20 13:00:18,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:18,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:18,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:18,179 INFO L87 Difference]: Start difference. First operand 838 states and 1129 transitions. Second operand 10 states. [2019-09-20 13:00:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,440 INFO L93 Difference]: Finished difference Result 854 states and 1146 transitions. [2019-09-20 13:00:18,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:18,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:00:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,447 INFO L225 Difference]: With dead ends: 854 [2019-09-20 13:00:18,447 INFO L226 Difference]: Without dead ends: 836 [2019-09-20 13:00:18,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-09-20 13:00:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-09-20 13:00:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-09-20 13:00:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1125 transitions. [2019-09-20 13:00:18,540 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1125 transitions. Word has length 56 [2019-09-20 13:00:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,541 INFO L475 AbstractCegarLoop]: Abstraction has 836 states and 1125 transitions. [2019-09-20 13:00:18,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1125 transitions. [2019-09-20 13:00:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:00:18,543 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,543 INFO L407 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-09-20 13:00:18,543 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1300823154, now seen corresponding path program 1 times [2019-09-20 13:00:18,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:18,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:18,669 INFO L87 Difference]: Start difference. First operand 836 states and 1125 transitions. Second operand 10 states. [2019-09-20 13:00:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,909 INFO L93 Difference]: Finished difference Result 849 states and 1139 transitions. [2019-09-20 13:00:18,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:18,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-09-20 13:00:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,913 INFO L225 Difference]: With dead ends: 849 [2019-09-20 13:00:18,913 INFO L226 Difference]: Without dead ends: 831 [2019-09-20 13:00:18,914 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-20 13:00:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2019-09-20 13:00:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-20 13:00:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1118 transitions. [2019-09-20 13:00:18,964 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1118 transitions. Word has length 55 [2019-09-20 13:00:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,964 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1118 transitions. [2019-09-20 13:00:18,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1118 transitions. [2019-09-20 13:00:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:00:18,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,968 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:00:18,968 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,969 INFO L82 PathProgramCache]: Analyzing trace with hash -498198185, now seen corresponding path program 1 times [2019-09-20 13:00:18,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,027 INFO L87 Difference]: Start difference. First operand 831 states and 1118 transitions. Second operand 3 states. [2019-09-20 13:00:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,085 INFO L93 Difference]: Finished difference Result 1084 states and 1452 transitions. [2019-09-20 13:00:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:00:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,099 INFO L225 Difference]: With dead ends: 1084 [2019-09-20 13:00:19,099 INFO L226 Difference]: Without dead ends: 921 [2019-09-20 13:00:19,101 INFO L636 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-09-20 13:00:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-09-20 13:00:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 890. [2019-09-20 13:00:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-20 13:00:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1194 transitions. [2019-09-20 13:00:19,168 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1194 transitions. Word has length 74 [2019-09-20 13:00:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,168 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1194 transitions. [2019-09-20 13:00:19,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1194 transitions. [2019-09-20 13:00:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:00:19,171 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,171 INFO L407 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-09-20 13:00:19,172 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash 907015974, now seen corresponding path program 1 times [2019-09-20 13:00:19,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,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-09-20 13:00:19,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:19,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:19,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:19,323 INFO L87 Difference]: Start difference. First operand 890 states and 1194 transitions. Second operand 11 states. [2019-09-20 13:00:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,609 INFO L93 Difference]: Finished difference Result 907 states and 1212 transitions. [2019-09-20 13:00:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:19,609 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-20 13:00:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,613 INFO L225 Difference]: With dead ends: 907 [2019-09-20 13:00:19,614 INFO L226 Difference]: Without dead ends: 887 [2019-09-20 13:00:19,615 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-20 13:00:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2019-09-20 13:00:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-09-20 13:00:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1189 transitions. [2019-09-20 13:00:19,665 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1189 transitions. Word has length 58 [2019-09-20 13:00:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,665 INFO L475 AbstractCegarLoop]: Abstraction has 887 states and 1189 transitions. [2019-09-20 13:00:19,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1189 transitions. [2019-09-20 13:00:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:00:19,668 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,669 INFO L407 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-09-20 13:00:19,669 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,669 INFO L82 PathProgramCache]: Analyzing trace with hash 771734352, now seen corresponding path program 1 times [2019-09-20 13:00:19,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-20 13:00:19,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 13:00:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 13:00:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:00:19,809 INFO L87 Difference]: Start difference. First operand 887 states and 1189 transitions. Second operand 12 states. [2019-09-20 13:00:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,066 INFO L93 Difference]: Finished difference Result 913 states and 1217 transitions. [2019-09-20 13:00:20,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:00:20,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-09-20 13:00:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,070 INFO L225 Difference]: With dead ends: 913 [2019-09-20 13:00:20,070 INFO L226 Difference]: Without dead ends: 888 [2019-09-20 13:00:20,072 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 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-09-20 13:00:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-09-20 13:00:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 886. [2019-09-20 13:00:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-09-20 13:00:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2019-09-20 13:00:20,124 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 59 [2019-09-20 13:00:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,125 INFO L475 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2019-09-20 13:00:20,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 13:00:20,125 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2019-09-20 13:00:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:00:20,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,128 INFO L407 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-09-20 13:00:20,129 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2100252890, now seen corresponding path program 1 times [2019-09-20 13:00:20,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:20,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:20,218 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand 9 states. [2019-09-20 13:00:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,456 INFO L93 Difference]: Finished difference Result 908 states and 1201 transitions. [2019-09-20 13:00:20,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:20,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-20 13:00:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,460 INFO L225 Difference]: With dead ends: 908 [2019-09-20 13:00:20,461 INFO L226 Difference]: Without dead ends: 874 [2019-09-20 13:00:20,462 INFO L636 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-09-20 13:00:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-20 13:00:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-09-20 13:00:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-20 13:00:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1157 transitions. [2019-09-20 13:00:20,537 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1157 transitions. Word has length 59 [2019-09-20 13:00:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,538 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1157 transitions. [2019-09-20 13:00:20,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1157 transitions. [2019-09-20 13:00:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:00:20,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,551 INFO L407 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] [2019-09-20 13:00:20,552 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210602, now seen corresponding path program 1 times [2019-09-20 13:00:20,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:20,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:20,610 INFO L87 Difference]: Start difference. First operand 874 states and 1157 transitions. Second operand 4 states. [2019-09-20 13:00:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,769 INFO L93 Difference]: Finished difference Result 1034 states and 1385 transitions. [2019-09-20 13:00:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:20,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-09-20 13:00:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,774 INFO L225 Difference]: With dead ends: 1034 [2019-09-20 13:00:20,775 INFO L226 Difference]: Without dead ends: 923 [2019-09-20 13:00:20,776 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-09-20 13:00:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 881. [2019-09-20 13:00:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-20 13:00:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1173 transitions. [2019-09-20 13:00:20,846 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1173 transitions. Word has length 60 [2019-09-20 13:00:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,847 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1173 transitions. [2019-09-20 13:00:20,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1173 transitions. [2019-09-20 13:00:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:00:20,851 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,852 INFO L407 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] [2019-09-20 13:00:20,852 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1292450988, now seen corresponding path program 1 times [2019-09-20 13:00:20,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat