./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60fa6dcffe947607e07f04cc37f17d0aae2288e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:33:45,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:33:45,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:33:45,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:33:45,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:33:45,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:33:45,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:33:45,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:33:45,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:33:45,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:33:45,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:33:45,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:33:45,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:33:45,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:33:45,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:33:45,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:33:45,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:33:45,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:33:45,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:33:45,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:33:45,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:33:45,947 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:33:45,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:33:45,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:33:45,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:33:45,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:33:45,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:33:45,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:33:45,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:33:45,952 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:33:45,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:33:45,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:33:45,953 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:33:45,953 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:33:45,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:33:45,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:33:45,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:33:45,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:33:45,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:33:45,964 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:33:45,965 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:33:45,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:33:45,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:33:45,965 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:33:45,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:33:45,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:33:45,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:33:45,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:33:45,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:33:45,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:33:45,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:33:45,969 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-11-10 10:33:45,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:33:46,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:33:46,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:33:46,004 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:33:46,005 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:33:46,005 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:46,044 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/data/4b33b8804/7bca516c03a44046a8df70174b6ffcd1/FLAGb9d15d1fa [2018-11-10 10:33:46,498 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:33:46,499 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:46,510 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/data/4b33b8804/7bca516c03a44046a8df70174b6ffcd1/FLAGb9d15d1fa [2018-11-10 10:33:46,519 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/data/4b33b8804/7bca516c03a44046a8df70174b6ffcd1 [2018-11-10 10:33:46,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:33:46,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:33:46,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:33:46,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:33:46,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:33:46,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4441de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46, skipping insertion in model container [2018-11-10 10:33:46,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:33:46,570 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:33:46,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:33:46,811 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:33:46,889 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:33:46,902 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:33:46,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46 WrapperNode [2018-11-10 10:33:46,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:33:46,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:33:46,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:33:46,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:33:46,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:46,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:47,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:47,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... [2018-11-10 10:33:47,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:33:47,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:33:47,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:33:47,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:33:47,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/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 [2018-11-10 10:33:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:33:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:33:47,077 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-10 10:33:47,078 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-10 10:33:47,079 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-10 10:33:47,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-10 10:33:47,081 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-10 10:33:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-10 10:33:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-10 10:33:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 10:33:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:33:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 10:33:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:33:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:33:47,458 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,458 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,549 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,549 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,610 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,611 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,683 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,683 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,725 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,725 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,874 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,875 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,908 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,909 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:47,929 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:47,929 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:48,062 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:33:48,062 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:33:48,076 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:33:48,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:48 BoogieIcfgContainer [2018-11-10 10:33:48,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:33:48,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:33:48,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:33:48,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:33:48,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:33:46" (1/3) ... [2018-11-10 10:33:48,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cec368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:33:48, skipping insertion in model container [2018-11-10 10:33:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:33:46" (2/3) ... [2018-11-10 10:33:48,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cec368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:33:48, skipping insertion in model container [2018-11-10 10:33:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:48" (3/3) ... [2018-11-10 10:33:48,082 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-10 10:33:48,089 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:33:48,095 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:33:48,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:33:48,129 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:33:48,129 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:33:48,129 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:33:48,129 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:33:48,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:33:48,130 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:33:48,130 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:33:48,130 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:33:48,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:33:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states. [2018-11-10 10:33:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 10:33:48,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:48,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:48,158 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:48,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash -448213016, now seen corresponding path program 1 times [2018-11-10 10:33:48,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:48,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:48,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:48,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:48,340 INFO L87 Difference]: Start difference. First operand 518 states. Second operand 3 states. [2018-11-10 10:33:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:48,500 INFO L93 Difference]: Finished difference Result 893 states and 1383 transitions. [2018-11-10 10:33:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:48,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 10:33:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:48,510 INFO L225 Difference]: With dead ends: 893 [2018-11-10 10:33:48,510 INFO L226 Difference]: Without dead ends: 510 [2018-11-10 10:33:48,514 INFO L605 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 [2018-11-10 10:33:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-10 10:33:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-11-10 10:33:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-11-10 10:33:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 741 transitions. [2018-11-10 10:33:48,574 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 741 transitions. Word has length 20 [2018-11-10 10:33:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:48,575 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 741 transitions. [2018-11-10 10:33:48,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 741 transitions. [2018-11-10 10:33:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:33:48,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:48,576 INFO L375 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] [2018-11-10 10:33:48,576 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:48,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1549764761, now seen corresponding path program 1 times [2018-11-10 10:33:48,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:48,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:48,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:48,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:48,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:48,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:48,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:48,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:48,689 INFO L87 Difference]: Start difference. First operand 510 states and 741 transitions. Second operand 3 states. [2018-11-10 10:33:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:48,963 INFO L93 Difference]: Finished difference Result 798 states and 1129 transitions. [2018-11-10 10:33:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:48,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 10:33:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:48,970 INFO L225 Difference]: With dead ends: 798 [2018-11-10 10:33:48,970 INFO L226 Difference]: Without dead ends: 676 [2018-11-10 10:33:48,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:48,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-11-10 10:33:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 656. [2018-11-10 10:33:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-10 10:33:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 936 transitions. [2018-11-10 10:33:49,009 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 936 transitions. Word has length 25 [2018-11-10 10:33:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:49,009 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 936 transitions. [2018-11-10 10:33:49,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 936 transitions. [2018-11-10 10:33:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:33:49,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:49,011 INFO L375 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] [2018-11-10 10:33:49,011 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:49,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 621330444, now seen corresponding path program 1 times [2018-11-10 10:33:49,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:49,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:49,066 INFO L87 Difference]: Start difference. First operand 656 states and 936 transitions. Second operand 3 states. [2018-11-10 10:33:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:49,123 INFO L93 Difference]: Finished difference Result 1005 states and 1391 transitions. [2018-11-10 10:33:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:49,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 10:33:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:49,128 INFO L225 Difference]: With dead ends: 1005 [2018-11-10 10:33:49,128 INFO L226 Difference]: Without dead ends: 827 [2018-11-10 10:33:49,129 INFO L605 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 [2018-11-10 10:33:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-10 10:33:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 773. [2018-11-10 10:33:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-11-10 10:33:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1098 transitions. [2018-11-10 10:33:49,170 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1098 transitions. Word has length 30 [2018-11-10 10:33:49,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:49,171 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 1098 transitions. [2018-11-10 10:33:49,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1098 transitions. [2018-11-10 10:33:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 10:33:49,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:49,173 INFO L375 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] [2018-11-10 10:33:49,173 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 472217655, now seen corresponding path program 1 times [2018-11-10 10:33:49,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:49,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:49,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:49,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:49,214 INFO L87 Difference]: Start difference. First operand 773 states and 1098 transitions. Second operand 3 states. [2018-11-10 10:33:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:49,437 INFO L93 Difference]: Finished difference Result 1442 states and 2113 transitions. [2018-11-10 10:33:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:49,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 10:33:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:49,443 INFO L225 Difference]: With dead ends: 1442 [2018-11-10 10:33:49,443 INFO L226 Difference]: Without dead ends: 1172 [2018-11-10 10:33:49,444 INFO L605 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 [2018-11-10 10:33:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-11-10 10:33:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 909. [2018-11-10 10:33:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2018-11-10 10:33:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1334 transitions. [2018-11-10 10:33:49,488 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1334 transitions. Word has length 31 [2018-11-10 10:33:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:49,488 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1334 transitions. [2018-11-10 10:33:49,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1334 transitions. [2018-11-10 10:33:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 10:33:49,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:49,490 INFO L375 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] [2018-11-10 10:33:49,490 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:49,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1515451823, now seen corresponding path program 1 times [2018-11-10 10:33:49,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:49,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:49,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:49,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:49,559 INFO L87 Difference]: Start difference. First operand 909 states and 1334 transitions. Second operand 5 states. [2018-11-10 10:33:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,093 INFO L93 Difference]: Finished difference Result 1582 states and 2329 transitions. [2018-11-10 10:33:50,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:33:50,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-10 10:33:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,097 INFO L225 Difference]: With dead ends: 1582 [2018-11-10 10:33:50,097 INFO L226 Difference]: Without dead ends: 998 [2018-11-10 10:33:50,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-10 10:33:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 897. [2018-11-10 10:33:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-11-10 10:33:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1310 transitions. [2018-11-10 10:33:50,130 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1310 transitions. Word has length 32 [2018-11-10 10:33:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:50,130 INFO L481 AbstractCegarLoop]: Abstraction has 897 states and 1310 transitions. [2018-11-10 10:33:50,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1310 transitions. [2018-11-10 10:33:50,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 10:33:50,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:50,132 INFO L375 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] [2018-11-10 10:33:50,132 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:50,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2146588537, now seen corresponding path program 1 times [2018-11-10 10:33:50,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:50,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:50,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:50,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:50,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:50,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,185 INFO L87 Difference]: Start difference. First operand 897 states and 1310 transitions. Second operand 3 states. [2018-11-10 10:33:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,240 INFO L93 Difference]: Finished difference Result 900 states and 1312 transitions. [2018-11-10 10:33:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:50,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 10:33:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,243 INFO L225 Difference]: With dead ends: 900 [2018-11-10 10:33:50,243 INFO L226 Difference]: Without dead ends: 896 [2018-11-10 10:33:50,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-11-10 10:33:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2018-11-10 10:33:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-10 10:33:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1307 transitions. [2018-11-10 10:33:50,271 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1307 transitions. Word has length 36 [2018-11-10 10:33:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:50,271 INFO L481 AbstractCegarLoop]: Abstraction has 896 states and 1307 transitions. [2018-11-10 10:33:50,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1307 transitions. [2018-11-10 10:33:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:33:50,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:50,273 INFO L375 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] [2018-11-10 10:33:50,273 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:50,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1811578744, now seen corresponding path program 1 times [2018-11-10 10:33:50,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:50,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:50,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,308 INFO L87 Difference]: Start difference. First operand 896 states and 1307 transitions. Second operand 3 states. [2018-11-10 10:33:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,351 INFO L93 Difference]: Finished difference Result 1292 states and 1836 transitions. [2018-11-10 10:33:50,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:50,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-10 10:33:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,355 INFO L225 Difference]: With dead ends: 1292 [2018-11-10 10:33:50,355 INFO L226 Difference]: Without dead ends: 1027 [2018-11-10 10:33:50,356 INFO L605 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 [2018-11-10 10:33:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-10 10:33:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 882. [2018-11-10 10:33:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 10:33:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1249 transitions. [2018-11-10 10:33:50,385 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1249 transitions. Word has length 39 [2018-11-10 10:33:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:50,385 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1249 transitions. [2018-11-10 10:33:50,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1249 transitions. [2018-11-10 10:33:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:33:50,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:50,387 INFO L375 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] [2018-11-10 10:33:50,387 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:50,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:50,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1349629560, now seen corresponding path program 1 times [2018-11-10 10:33:50,387 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:50,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:50,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:50,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:50,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:50,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,421 INFO L87 Difference]: Start difference. First operand 882 states and 1249 transitions. Second operand 3 states. [2018-11-10 10:33:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,467 INFO L93 Difference]: Finished difference Result 984 states and 1377 transitions. [2018-11-10 10:33:50,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:50,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-10 10:33:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,470 INFO L225 Difference]: With dead ends: 984 [2018-11-10 10:33:50,470 INFO L226 Difference]: Without dead ends: 964 [2018-11-10 10:33:50,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-11-10 10:33:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 908. [2018-11-10 10:33:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-10 10:33:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1284 transitions. [2018-11-10 10:33:50,501 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1284 transitions. Word has length 40 [2018-11-10 10:33:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:50,501 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1284 transitions. [2018-11-10 10:33:50,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1284 transitions. [2018-11-10 10:33:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 10:33:50,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:50,504 INFO L375 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] [2018-11-10 10:33:50,504 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:50,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 291360619, now seen corresponding path program 1 times [2018-11-10 10:33:50,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:50,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:50,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:50,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:50,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:50,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:50,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:50,545 INFO L87 Difference]: Start difference. First operand 908 states and 1284 transitions. Second operand 3 states. [2018-11-10 10:33:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,594 INFO L93 Difference]: Finished difference Result 1187 states and 1663 transitions. [2018-11-10 10:33:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:50,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-10 10:33:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,597 INFO L225 Difference]: With dead ends: 1187 [2018-11-10 10:33:50,597 INFO L226 Difference]: Without dead ends: 941 [2018-11-10 10:33:50,598 INFO L605 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 [2018-11-10 10:33:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-11-10 10:33:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 908. [2018-11-10 10:33:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-10 10:33:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1283 transitions. [2018-11-10 10:33:50,635 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1283 transitions. Word has length 46 [2018-11-10 10:33:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:50,636 INFO L481 AbstractCegarLoop]: Abstraction has 908 states and 1283 transitions. [2018-11-10 10:33:50,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1283 transitions. [2018-11-10 10:33:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 10:33:50,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:50,638 INFO L375 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] [2018-11-10 10:33:50,638 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:50,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:50,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1783887188, now seen corresponding path program 1 times [2018-11-10 10:33:50,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:50,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:50,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:50,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:50,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:50,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:50,685 INFO L87 Difference]: Start difference. First operand 908 states and 1283 transitions. Second operand 4 states. [2018-11-10 10:33:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:50,961 INFO L93 Difference]: Finished difference Result 1030 states and 1429 transitions. [2018-11-10 10:33:50,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:50,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-10 10:33:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:50,966 INFO L225 Difference]: With dead ends: 1030 [2018-11-10 10:33:50,966 INFO L226 Difference]: Without dead ends: 797 [2018-11-10 10:33:50,967 INFO L605 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 [2018-11-10 10:33:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-10 10:33:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 763. [2018-11-10 10:33:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 10:33:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1072 transitions. [2018-11-10 10:33:51,009 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1072 transitions. Word has length 47 [2018-11-10 10:33:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,009 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 1072 transitions. [2018-11-10 10:33:51,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1072 transitions. [2018-11-10 10:33:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 10:33:51,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,011 INFO L375 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] [2018-11-10 10:33:51,012 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,012 INFO L82 PathProgramCache]: Analyzing trace with hash -992605317, now seen corresponding path program 1 times [2018-11-10 10:33:51,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:51,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:51,061 INFO L87 Difference]: Start difference. First operand 763 states and 1072 transitions. Second operand 3 states. [2018-11-10 10:33:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,102 INFO L93 Difference]: Finished difference Result 883 states and 1220 transitions. [2018-11-10 10:33:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:51,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-10 10:33:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,107 INFO L225 Difference]: With dead ends: 883 [2018-11-10 10:33:51,107 INFO L226 Difference]: Without dead ends: 787 [2018-11-10 10:33:51,108 INFO L605 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 [2018-11-10 10:33:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-10 10:33:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 762. [2018-11-10 10:33:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-10 10:33:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1067 transitions. [2018-11-10 10:33:51,149 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1067 transitions. Word has length 47 [2018-11-10 10:33:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,149 INFO L481 AbstractCegarLoop]: Abstraction has 762 states and 1067 transitions. [2018-11-10 10:33:51,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1067 transitions. [2018-11-10 10:33:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 10:33:51,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,152 INFO L375 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] [2018-11-10 10:33:51,152 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1733809897, now seen corresponding path program 1 times [2018-11-10 10:33:51,152 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:51,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:51,183 INFO L87 Difference]: Start difference. First operand 762 states and 1067 transitions. Second operand 3 states. [2018-11-10 10:33:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,280 INFO L93 Difference]: Finished difference Result 963 states and 1332 transitions. [2018-11-10 10:33:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:51,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 10:33:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,285 INFO L225 Difference]: With dead ends: 963 [2018-11-10 10:33:51,285 INFO L226 Difference]: Without dead ends: 949 [2018-11-10 10:33:51,286 INFO L605 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 [2018-11-10 10:33:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-11-10 10:33:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 841. [2018-11-10 10:33:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-10 10:33:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2018-11-10 10:33:51,332 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 48 [2018-11-10 10:33:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,332 INFO L481 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2018-11-10 10:33:51,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2018-11-10 10:33:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 10:33:51,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,334 INFO L375 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] [2018-11-10 10:33:51,335 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1764634278, now seen corresponding path program 1 times [2018-11-10 10:33:51,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:33:51,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:33:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:33:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:33:51,384 INFO L87 Difference]: Start difference. First operand 841 states and 1159 transitions. Second operand 8 states. [2018-11-10 10:33:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,527 INFO L93 Difference]: Finished difference Result 867 states and 1193 transitions. [2018-11-10 10:33:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:33:51,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 10:33:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,532 INFO L225 Difference]: With dead ends: 867 [2018-11-10 10:33:51,532 INFO L226 Difference]: Without dead ends: 863 [2018-11-10 10:33:51,533 INFO L605 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 [2018-11-10 10:33:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-11-10 10:33:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 860. [2018-11-10 10:33:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-10 10:33:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1186 transitions. [2018-11-10 10:33:51,578 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1186 transitions. Word has length 49 [2018-11-10 10:33:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,578 INFO L481 AbstractCegarLoop]: Abstraction has 860 states and 1186 transitions. [2018-11-10 10:33:51,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:33:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1186 transitions. [2018-11-10 10:33:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-10 10:33:51,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,580 INFO L375 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] [2018-11-10 10:33:51,580 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1764911108, now seen corresponding path program 1 times [2018-11-10 10:33:51,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:33:51,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:33:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:33:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:33:51,643 INFO L87 Difference]: Start difference. First operand 860 states and 1186 transitions. Second operand 8 states. [2018-11-10 10:33:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,740 INFO L93 Difference]: Finished difference Result 902 states and 1238 transitions. [2018-11-10 10:33:51,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:33:51,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-10 10:33:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,744 INFO L225 Difference]: With dead ends: 902 [2018-11-10 10:33:51,744 INFO L226 Difference]: Without dead ends: 881 [2018-11-10 10:33:51,745 INFO L605 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 [2018-11-10 10:33:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-11-10 10:33:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 880. [2018-11-10 10:33:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 10:33:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1210 transitions. [2018-11-10 10:33:51,790 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1210 transitions. Word has length 49 [2018-11-10 10:33:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,790 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1210 transitions. [2018-11-10 10:33:51,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:33:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1210 transitions. [2018-11-10 10:33:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:33:51,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,793 INFO L375 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] [2018-11-10 10:33:51,793 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1085825170, now seen corresponding path program 1 times [2018-11-10 10:33:51,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:51,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:51,831 INFO L87 Difference]: Start difference. First operand 880 states and 1210 transitions. Second operand 4 states. [2018-11-10 10:33:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:51,887 INFO L93 Difference]: Finished difference Result 905 states and 1235 transitions. [2018-11-10 10:33:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:51,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-10 10:33:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:51,891 INFO L225 Difference]: With dead ends: 905 [2018-11-10 10:33:51,891 INFO L226 Difference]: Without dead ends: 883 [2018-11-10 10:33:51,891 INFO L605 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 [2018-11-10 10:33:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-11-10 10:33:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2018-11-10 10:33:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-11-10 10:33:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1209 transitions. [2018-11-10 10:33:51,934 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1209 transitions. Word has length 50 [2018-11-10 10:33:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:51,934 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1209 transitions. [2018-11-10 10:33:51,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1209 transitions. [2018-11-10 10:33:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:33:51,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:51,936 INFO L375 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] [2018-11-10 10:33:51,936 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:51,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash -908319536, now seen corresponding path program 1 times [2018-11-10 10:33:51,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:51,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:51,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:51,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:51,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:33:51,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:33:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:33:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:33:51,983 INFO L87 Difference]: Start difference. First operand 880 states and 1209 transitions. Second operand 7 states. [2018-11-10 10:33:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:52,828 INFO L93 Difference]: Finished difference Result 1092 states and 1543 transitions. [2018-11-10 10:33:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:33:52,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-10 10:33:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:52,833 INFO L225 Difference]: With dead ends: 1092 [2018-11-10 10:33:52,833 INFO L226 Difference]: Without dead ends: 1001 [2018-11-10 10:33:52,834 INFO L605 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 [2018-11-10 10:33:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-11-10 10:33:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 859. [2018-11-10 10:33:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-11-10 10:33:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1172 transitions. [2018-11-10 10:33:52,883 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1172 transitions. Word has length 50 [2018-11-10 10:33:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:52,883 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 1172 transitions. [2018-11-10 10:33:52,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:33:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1172 transitions. [2018-11-10 10:33:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:33:52,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:52,885 INFO L375 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] [2018-11-10 10:33:52,885 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -761626734, now seen corresponding path program 1 times [2018-11-10 10:33:52,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:52,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:52,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:52,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:52,915 INFO L87 Difference]: Start difference. First operand 859 states and 1172 transitions. Second operand 3 states. [2018-11-10 10:33:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:53,012 INFO L93 Difference]: Finished difference Result 1043 states and 1413 transitions. [2018-11-10 10:33:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:53,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 10:33:53,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:53,016 INFO L225 Difference]: With dead ends: 1043 [2018-11-10 10:33:53,016 INFO L226 Difference]: Without dead ends: 1003 [2018-11-10 10:33:53,017 INFO L605 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 [2018-11-10 10:33:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-10 10:33:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 893. [2018-11-10 10:33:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-10 10:33:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1204 transitions. [2018-11-10 10:33:53,067 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1204 transitions. Word has length 50 [2018-11-10 10:33:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:53,068 INFO L481 AbstractCegarLoop]: Abstraction has 893 states and 1204 transitions. [2018-11-10 10:33:53,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1204 transitions. [2018-11-10 10:33:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:33:53,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:53,070 INFO L375 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] [2018-11-10 10:33:53,070 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:53,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1782043445, now seen corresponding path program 1 times [2018-11-10 10:33:53,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:53,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:53,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:53,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:33:53,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:33:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:33:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:53,165 INFO L87 Difference]: Start difference. First operand 893 states and 1204 transitions. Second operand 9 states. [2018-11-10 10:33:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:54,616 INFO L93 Difference]: Finished difference Result 1215 states and 1676 transitions. [2018-11-10 10:33:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 10:33:54,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-10 10:33:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:54,620 INFO L225 Difference]: With dead ends: 1215 [2018-11-10 10:33:54,621 INFO L226 Difference]: Without dead ends: 1146 [2018-11-10 10:33:54,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:33:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2018-11-10 10:33:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 906. [2018-11-10 10:33:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-11-10 10:33:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1229 transitions. [2018-11-10 10:33:54,676 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1229 transitions. Word has length 50 [2018-11-10 10:33:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:54,676 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1229 transitions. [2018-11-10 10:33:54,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:33:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1229 transitions. [2018-11-10 10:33:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 10:33:54,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:54,678 INFO L375 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] [2018-11-10 10:33:54,679 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:54,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 417807011, now seen corresponding path program 1 times [2018-11-10 10:33:54,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:54,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:54,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:54,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:54,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:54,730 INFO L87 Difference]: Start difference. First operand 906 states and 1229 transitions. Second operand 3 states. [2018-11-10 10:33:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:54,818 INFO L93 Difference]: Finished difference Result 934 states and 1261 transitions. [2018-11-10 10:33:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:54,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-10 10:33:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:54,822 INFO L225 Difference]: With dead ends: 934 [2018-11-10 10:33:54,822 INFO L226 Difference]: Without dead ends: 929 [2018-11-10 10:33:54,823 INFO L605 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 [2018-11-10 10:33:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-11-10 10:33:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 923. [2018-11-10 10:33:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-10 10:33:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1250 transitions. [2018-11-10 10:33:54,877 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1250 transitions. Word has length 52 [2018-11-10 10:33:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:54,877 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1250 transitions. [2018-11-10 10:33:54,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1250 transitions. [2018-11-10 10:33:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:33:54,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:54,879 INFO L375 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] [2018-11-10 10:33:54,879 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:54,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1677129215, now seen corresponding path program 1 times [2018-11-10 10:33:54,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:54,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:54,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:54,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:54,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:54,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:54,925 INFO L87 Difference]: Start difference. First operand 923 states and 1250 transitions. Second operand 3 states. [2018-11-10 10:33:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:55,016 INFO L93 Difference]: Finished difference Result 1142 states and 1544 transitions. [2018-11-10 10:33:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:55,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-10 10:33:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:55,020 INFO L225 Difference]: With dead ends: 1142 [2018-11-10 10:33:55,020 INFO L226 Difference]: Without dead ends: 892 [2018-11-10 10:33:55,021 INFO L605 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 [2018-11-10 10:33:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-11-10 10:33:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2018-11-10 10:33:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-10 10:33:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1210 transitions. [2018-11-10 10:33:55,073 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1210 transitions. Word has length 54 [2018-11-10 10:33:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:55,073 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1210 transitions. [2018-11-10 10:33:55,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1210 transitions. [2018-11-10 10:33:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-10 10:33:55,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:55,075 INFO L375 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] [2018-11-10 10:33:55,075 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:55,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 510703600, now seen corresponding path program 1 times [2018-11-10 10:33:55,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:55,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:55,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:55,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:55,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:55,119 INFO L87 Difference]: Start difference. First operand 892 states and 1210 transitions. Second operand 5 states. [2018-11-10 10:33:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:55,550 INFO L93 Difference]: Finished difference Result 904 states and 1220 transitions. [2018-11-10 10:33:55,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:33:55,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-10 10:33:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:55,554 INFO L225 Difference]: With dead ends: 904 [2018-11-10 10:33:55,555 INFO L226 Difference]: Without dead ends: 898 [2018-11-10 10:33:55,556 INFO L605 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 [2018-11-10 10:33:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-10 10:33:55,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 892. [2018-11-10 10:33:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-10 10:33:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1209 transitions. [2018-11-10 10:33:55,613 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1209 transitions. Word has length 53 [2018-11-10 10:33:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:55,613 INFO L481 AbstractCegarLoop]: Abstraction has 892 states and 1209 transitions. [2018-11-10 10:33:55,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1209 transitions. [2018-11-10 10:33:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 10:33:55,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:55,616 INFO L375 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] [2018-11-10 10:33:55,616 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:55,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1022255578, now seen corresponding path program 1 times [2018-11-10 10:33:55,617 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:55,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:55,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:55,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:55,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:55,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:55,668 INFO L87 Difference]: Start difference. First operand 892 states and 1209 transitions. Second operand 5 states. [2018-11-10 10:33:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:56,139 INFO L93 Difference]: Finished difference Result 907 states and 1224 transitions. [2018-11-10 10:33:56,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:33:56,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-10 10:33:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:56,143 INFO L225 Difference]: With dead ends: 907 [2018-11-10 10:33:56,143 INFO L226 Difference]: Without dead ends: 871 [2018-11-10 10:33:56,144 INFO L605 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 [2018-11-10 10:33:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2018-11-10 10:33:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2018-11-10 10:33:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 10:33:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1179 transitions. [2018-11-10 10:33:56,200 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1179 transitions. Word has length 52 [2018-11-10 10:33:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:56,201 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1179 transitions. [2018-11-10 10:33:56,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1179 transitions. [2018-11-10 10:33:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 10:33:56,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:56,204 INFO L375 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] [2018-11-10 10:33:56,204 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:56,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:56,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1980078936, now seen corresponding path program 1 times [2018-11-10 10:33:56,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:56,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:56,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:56,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:56,253 INFO L87 Difference]: Start difference. First operand 865 states and 1179 transitions. Second operand 5 states. [2018-11-10 10:33:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:56,680 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2018-11-10 10:33:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:33:56,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-10 10:33:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:56,683 INFO L225 Difference]: With dead ends: 875 [2018-11-10 10:33:56,683 INFO L226 Difference]: Without dead ends: 869 [2018-11-10 10:33:56,683 INFO L605 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 [2018-11-10 10:33:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-10 10:33:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 865. [2018-11-10 10:33:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-10 10:33:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1178 transitions. [2018-11-10 10:33:56,729 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1178 transitions. Word has length 54 [2018-11-10 10:33:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:56,730 INFO L481 AbstractCegarLoop]: Abstraction has 865 states and 1178 transitions. [2018-11-10 10:33:56,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1178 transitions. [2018-11-10 10:33:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 10:33:56,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:56,731 INFO L375 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] [2018-11-10 10:33:56,732 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:56,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -940758887, now seen corresponding path program 1 times [2018-11-10 10:33:56,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:56,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:56,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:56,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:56,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:33:56,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:33:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:33:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:33:56,782 INFO L87 Difference]: Start difference. First operand 865 states and 1178 transitions. Second operand 9 states. [2018-11-10 10:33:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:56,906 INFO L93 Difference]: Finished difference Result 892 states and 1208 transitions. [2018-11-10 10:33:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:33:56,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-10 10:33:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:56,909 INFO L225 Difference]: With dead ends: 892 [2018-11-10 10:33:56,909 INFO L226 Difference]: Without dead ends: 856 [2018-11-10 10:33:56,910 INFO L605 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 [2018-11-10 10:33:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-10 10:33:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-11-10 10:33:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 10:33:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1154 transitions. [2018-11-10 10:33:56,942 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1154 transitions. Word has length 55 [2018-11-10 10:33:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:56,942 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1154 transitions. [2018-11-10 10:33:56,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:33:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1154 transitions. [2018-11-10 10:33:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 10:33:56,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:56,944 INFO L375 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] [2018-11-10 10:33:56,944 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -548453257, now seen corresponding path program 1 times [2018-11-10 10:33:56,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:56,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:57,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:57,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:33:57,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:33:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:33:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:33:57,027 INFO L87 Difference]: Start difference. First operand 856 states and 1154 transitions. Second operand 10 states. [2018-11-10 10:33:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:57,184 INFO L93 Difference]: Finished difference Result 872 states and 1171 transitions. [2018-11-10 10:33:57,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:33:57,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-10 10:33:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:57,187 INFO L225 Difference]: With dead ends: 872 [2018-11-10 10:33:57,187 INFO L226 Difference]: Without dead ends: 854 [2018-11-10 10:33:57,188 INFO L605 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 [2018-11-10 10:33:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-11-10 10:33:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2018-11-10 10:33:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-10 10:33:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1150 transitions. [2018-11-10 10:33:57,239 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1150 transitions. Word has length 55 [2018-11-10 10:33:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:57,240 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1150 transitions. [2018-11-10 10:33:57,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:33:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1150 transitions. [2018-11-10 10:33:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-10 10:33:57,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:57,242 INFO L375 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] [2018-11-10 10:33:57,242 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:57,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash -769794208, now seen corresponding path program 1 times [2018-11-10 10:33:57,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:57,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:57,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:33:57,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:33:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:33:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:33:57,363 INFO L87 Difference]: Start difference. First operand 854 states and 1150 transitions. Second operand 10 states. [2018-11-10 10:33:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:57,527 INFO L93 Difference]: Finished difference Result 867 states and 1164 transitions. [2018-11-10 10:33:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:33:57,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-10 10:33:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:57,531 INFO L225 Difference]: With dead ends: 867 [2018-11-10 10:33:57,531 INFO L226 Difference]: Without dead ends: 849 [2018-11-10 10:33:57,532 INFO L605 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 [2018-11-10 10:33:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-10 10:33:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2018-11-10 10:33:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-11-10 10:33:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1143 transitions. [2018-11-10 10:33:57,589 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1143 transitions. Word has length 56 [2018-11-10 10:33:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:57,589 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 1143 transitions. [2018-11-10 10:33:57,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:33:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1143 transitions. [2018-11-10 10:33:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:33:57,591 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:57,591 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:57,591 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:57,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1437911526, now seen corresponding path program 1 times [2018-11-10 10:33:57,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:57,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:57,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:57,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:57,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:33:57,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:33:57,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:33:57,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:33:57,650 INFO L87 Difference]: Start difference. First operand 849 states and 1143 transitions. Second operand 5 states. [2018-11-10 10:33:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:57,984 INFO L93 Difference]: Finished difference Result 1286 states and 1741 transitions. [2018-11-10 10:33:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:33:57,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-10 10:33:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:57,987 INFO L225 Difference]: With dead ends: 1286 [2018-11-10 10:33:57,987 INFO L226 Difference]: Without dead ends: 838 [2018-11-10 10:33:57,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:33:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-10 10:33:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-10 10:33:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 10:33:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1114 transitions. [2018-11-10 10:33:58,045 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1114 transitions. Word has length 73 [2018-11-10 10:33:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:58,046 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1114 transitions. [2018-11-10 10:33:58,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:33:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1114 transitions. [2018-11-10 10:33:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 10:33:58,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:58,050 INFO L375 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] [2018-11-10 10:33:58,050 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:58,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 528467351, now seen corresponding path program 1 times [2018-11-10 10:33:58,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:58,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:33:58,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:33:58,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:33:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:58,092 INFO L87 Difference]: Start difference. First operand 838 states and 1114 transitions. Second operand 3 states. [2018-11-10 10:33:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:58,150 INFO L93 Difference]: Finished difference Result 970 states and 1274 transitions. [2018-11-10 10:33:58,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:33:58,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 10:33:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:58,154 INFO L225 Difference]: With dead ends: 970 [2018-11-10 10:33:58,154 INFO L226 Difference]: Without dead ends: 878 [2018-11-10 10:33:58,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:33:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-11-10 10:33:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2018-11-10 10:33:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-11-10 10:33:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1133 transitions. [2018-11-10 10:33:58,206 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1133 transitions. Word has length 74 [2018-11-10 10:33:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:58,207 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1133 transitions. [2018-11-10 10:33:58,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:33:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1133 transitions. [2018-11-10 10:33:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 10:33:58,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:58,221 INFO L375 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] [2018-11-10 10:33:58,221 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:58,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:58,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1144916251, now seen corresponding path program 1 times [2018-11-10 10:33:58,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:58,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:58,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:33:58,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:33:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:33:58,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:33:58,344 INFO L87 Difference]: Start difference. First operand 855 states and 1133 transitions. Second operand 12 states. [2018-11-10 10:33:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:58,489 INFO L93 Difference]: Finished difference Result 881 states and 1161 transitions. [2018-11-10 10:33:58,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:33:58,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-10 10:33:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:58,491 INFO L225 Difference]: With dead ends: 881 [2018-11-10 10:33:58,491 INFO L226 Difference]: Without dead ends: 856 [2018-11-10 10:33:58,492 INFO L605 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 [2018-11-10 10:33:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-11-10 10:33:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 854. [2018-11-10 10:33:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-10 10:33:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1122 transitions. [2018-11-10 10:33:58,528 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1122 transitions. Word has length 59 [2018-11-10 10:33:58,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:58,528 INFO L481 AbstractCegarLoop]: Abstraction has 854 states and 1122 transitions. [2018-11-10 10:33:58,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:33:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1122 transitions. [2018-11-10 10:33:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 10:33:58,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:58,530 INFO L375 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] [2018-11-10 10:33:58,531 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:58,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677282, now seen corresponding path program 1 times [2018-11-10 10:33:58,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:58,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:58,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:58,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:33:58,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:33:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:33:58,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:33:58,620 INFO L87 Difference]: Start difference. First operand 854 states and 1122 transitions. Second operand 11 states. [2018-11-10 10:33:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:58,804 INFO L93 Difference]: Finished difference Result 871 states and 1140 transitions. [2018-11-10 10:33:58,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:33:58,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-10 10:33:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:58,807 INFO L225 Difference]: With dead ends: 871 [2018-11-10 10:33:58,807 INFO L226 Difference]: Without dead ends: 851 [2018-11-10 10:33:58,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:33:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-10 10:33:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-11-10 10:33:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-10 10:33:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1117 transitions. [2018-11-10 10:33:58,855 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1117 transitions. Word has length 58 [2018-11-10 10:33:58,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:58,855 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1117 transitions. [2018-11-10 10:33:58,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:33:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1117 transitions. [2018-11-10 10:33:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 10:33:58,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:58,856 INFO L375 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] [2018-11-10 10:33:58,856 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:58,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash -719999499, now seen corresponding path program 1 times [2018-11-10 10:33:58,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:58,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:58,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:58,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:33:58,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:33:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:33:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:33:58,945 INFO L87 Difference]: Start difference. First operand 851 states and 1117 transitions. Second operand 10 states. [2018-11-10 10:33:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:59,185 INFO L93 Difference]: Finished difference Result 918 states and 1192 transitions. [2018-11-10 10:33:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:33:59,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-10 10:33:59,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:59,188 INFO L225 Difference]: With dead ends: 918 [2018-11-10 10:33:59,188 INFO L226 Difference]: Without dead ends: 809 [2018-11-10 10:33:59,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:33:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-11-10 10:33:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2018-11-10 10:33:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-11-10 10:33:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1036 transitions. [2018-11-10 10:33:59,222 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1036 transitions. Word has length 59 [2018-11-10 10:33:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:59,222 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 1036 transitions. [2018-11-10 10:33:59,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:33:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1036 transitions. [2018-11-10 10:33:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 10:33:59,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:59,223 INFO L375 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] [2018-11-10 10:33:59,224 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:59,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash -98888530, now seen corresponding path program 1 times [2018-11-10 10:33:59,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:59,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:33:59,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:33:59,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:33:59,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:33:59,254 INFO L87 Difference]: Start difference. First operand 806 states and 1036 transitions. Second operand 4 states. [2018-11-10 10:33:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:59,340 INFO L93 Difference]: Finished difference Result 946 states and 1224 transitions. [2018-11-10 10:33:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:33:59,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 10:33:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:59,343 INFO L225 Difference]: With dead ends: 946 [2018-11-10 10:33:59,343 INFO L226 Difference]: Without dead ends: 844 [2018-11-10 10:33:59,344 INFO L605 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 [2018-11-10 10:33:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2018-11-10 10:33:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 813. [2018-11-10 10:33:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-11-10 10:33:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1050 transitions. [2018-11-10 10:33:59,375 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1050 transitions. Word has length 60 [2018-11-10 10:33:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:59,375 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1050 transitions. [2018-11-10 10:33:59,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:33:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1050 transitions. [2018-11-10 10:33:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 10:33:59,376 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:59,376 INFO L375 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] [2018-11-10 10:33:59,377 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:59,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash 175871084, now seen corresponding path program 1 times [2018-11-10 10:33:59,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:59,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:59,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:59,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:33:59,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:33:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:33:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:33:59,445 INFO L87 Difference]: Start difference. First operand 813 states and 1050 transitions. Second operand 11 states. [2018-11-10 10:33:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:59,527 INFO L93 Difference]: Finished difference Result 880 states and 1139 transitions. [2018-11-10 10:33:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:33:59,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-10 10:33:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:59,530 INFO L225 Difference]: With dead ends: 880 [2018-11-10 10:33:59,530 INFO L226 Difference]: Without dead ends: 825 [2018-11-10 10:33:59,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:33:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-11-10 10:33:59,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 817. [2018-11-10 10:33:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-10 10:33:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1067 transitions. [2018-11-10 10:33:59,563 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1067 transitions. Word has length 60 [2018-11-10 10:33:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:59,563 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1067 transitions. [2018-11-10 10:33:59,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:33:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1067 transitions. [2018-11-10 10:33:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:33:59,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:59,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:59,565 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:59,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2134007521, now seen corresponding path program 1 times [2018-11-10 10:33:59,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:59,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:59,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:33:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:59,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:33:59,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:33:59,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:33:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:33:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:33:59,649 INFO L87 Difference]: Start difference. First operand 817 states and 1067 transitions. Second operand 12 states. [2018-11-10 10:33:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:33:59,817 INFO L93 Difference]: Finished difference Result 841 states and 1092 transitions. [2018-11-10 10:33:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:33:59,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-10 10:33:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:33:59,820 INFO L225 Difference]: With dead ends: 841 [2018-11-10 10:33:59,820 INFO L226 Difference]: Without dead ends: 817 [2018-11-10 10:33:59,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:33:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-11-10 10:33:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 815. [2018-11-10 10:33:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-11-10 10:33:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1063 transitions. [2018-11-10 10:33:59,887 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1063 transitions. Word has length 66 [2018-11-10 10:33:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:33:59,887 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 1063 transitions. [2018-11-10 10:33:59,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:33:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1063 transitions. [2018-11-10 10:33:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 10:33:59,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:33:59,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:33:59,889 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:33:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:33:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1149940409, now seen corresponding path program 1 times [2018-11-10 10:33:59,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:33:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:33:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:33:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:33:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:34:00,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:34:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:34:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:34:00,033 INFO L87 Difference]: Start difference. First operand 815 states and 1063 transitions. Second operand 12 states. [2018-11-10 10:34:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:00,201 INFO L93 Difference]: Finished difference Result 837 states and 1086 transitions. [2018-11-10 10:34:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:34:00,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-10 10:34:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:00,203 INFO L225 Difference]: With dead ends: 837 [2018-11-10 10:34:00,203 INFO L226 Difference]: Without dead ends: 813 [2018-11-10 10:34:00,203 INFO L605 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 [2018-11-10 10:34:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-11-10 10:34:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2018-11-10 10:34:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-11-10 10:34:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1059 transitions. [2018-11-10 10:34:00,235 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1059 transitions. Word has length 63 [2018-11-10 10:34:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:00,235 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1059 transitions. [2018-11-10 10:34:00,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:34:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1059 transitions. [2018-11-10 10:34:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:34:00,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:00,236 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:00,237 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:00,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -543334915, now seen corresponding path program 1 times [2018-11-10 10:34:00,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:00,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:00,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:00,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:00,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:00,271 INFO L87 Difference]: Start difference. First operand 813 states and 1059 transitions. Second operand 5 states. [2018-11-10 10:34:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:00,362 INFO L93 Difference]: Finished difference Result 847 states and 1098 transitions. [2018-11-10 10:34:00,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:00,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-10 10:34:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:00,364 INFO L225 Difference]: With dead ends: 847 [2018-11-10 10:34:00,364 INFO L226 Difference]: Without dead ends: 820 [2018-11-10 10:34:00,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:34:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-11-10 10:34:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2018-11-10 10:34:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-11-10 10:34:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1067 transitions. [2018-11-10 10:34:00,395 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1067 transitions. Word has length 67 [2018-11-10 10:34:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:00,395 INFO L481 AbstractCegarLoop]: Abstraction has 818 states and 1067 transitions. [2018-11-10 10:34:00,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2018-11-10 10:34:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 10:34:00,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:00,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:00,397 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:00,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1385952928, now seen corresponding path program 1 times [2018-11-10 10:34:00,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:00,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:00,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:00,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:00,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:34:00,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:34:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:34:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:34:00,468 INFO L87 Difference]: Start difference. First operand 818 states and 1067 transitions. Second operand 12 states. [2018-11-10 10:34:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:00,602 INFO L93 Difference]: Finished difference Result 842 states and 1092 transitions. [2018-11-10 10:34:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:34:00,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-10 10:34:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:00,605 INFO L225 Difference]: With dead ends: 842 [2018-11-10 10:34:00,605 INFO L226 Difference]: Without dead ends: 818 [2018-11-10 10:34:00,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:34:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-11-10 10:34:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2018-11-10 10:34:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-11-10 10:34:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1063 transitions. [2018-11-10 10:34:00,636 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1063 transitions. Word has length 62 [2018-11-10 10:34:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:00,637 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1063 transitions. [2018-11-10 10:34:00,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:34:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1063 transitions. [2018-11-10 10:34:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 10:34:00,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:00,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:00,639 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:00,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash 478731919, now seen corresponding path program 1 times [2018-11-10 10:34:00,639 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:00,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:00,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:00,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:00,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:34:00,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:34:00,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:34:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:34:00,664 INFO L87 Difference]: Start difference. First operand 816 states and 1063 transitions. Second operand 3 states. [2018-11-10 10:34:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:00,691 INFO L93 Difference]: Finished difference Result 1070 states and 1388 transitions. [2018-11-10 10:34:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:34:00,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-10 10:34:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:00,694 INFO L225 Difference]: With dead ends: 1070 [2018-11-10 10:34:00,694 INFO L226 Difference]: Without dead ends: 762 [2018-11-10 10:34:00,695 INFO L605 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 [2018-11-10 10:34:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-11-10 10:34:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 744. [2018-11-10 10:34:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-11-10 10:34:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 946 transitions. [2018-11-10 10:34:00,722 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 946 transitions. Word has length 62 [2018-11-10 10:34:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:00,722 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 946 transitions. [2018-11-10 10:34:00,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:34:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 946 transitions. [2018-11-10 10:34:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:00,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:00,724 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:00,724 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:00,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1067040035, now seen corresponding path program 1 times [2018-11-10 10:34:00,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:00,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:00,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:00,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:34:00,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:34:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:34:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:00,845 INFO L87 Difference]: Start difference. First operand 744 states and 946 transitions. Second operand 13 states. [2018-11-10 10:34:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:01,047 INFO L93 Difference]: Finished difference Result 761 states and 964 transitions. [2018-11-10 10:34:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:34:01,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-10 10:34:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:01,051 INFO L225 Difference]: With dead ends: 761 [2018-11-10 10:34:01,051 INFO L226 Difference]: Without dead ends: 733 [2018-11-10 10:34:01,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-11-10 10:34:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2018-11-10 10:34:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-10 10:34:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 931 transitions. [2018-11-10 10:34:01,088 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 931 transitions. Word has length 69 [2018-11-10 10:34:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:01,088 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 931 transitions. [2018-11-10 10:34:01,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:34:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 931 transitions. [2018-11-10 10:34:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 10:34:01,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:01,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:01,089 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:01,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -48275879, now seen corresponding path program 1 times [2018-11-10 10:34:01,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:01,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:01,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:34:01,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:34:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:34:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:01,223 INFO L87 Difference]: Start difference. First operand 733 states and 931 transitions. Second operand 13 states. [2018-11-10 10:34:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:01,388 INFO L93 Difference]: Finished difference Result 750 states and 949 transitions. [2018-11-10 10:34:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:34:01,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-10 10:34:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:01,390 INFO L225 Difference]: With dead ends: 750 [2018-11-10 10:34:01,390 INFO L226 Difference]: Without dead ends: 728 [2018-11-10 10:34:01,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-11-10 10:34:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-11-10 10:34:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-11-10 10:34:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 924 transitions. [2018-11-10 10:34:01,419 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 924 transitions. Word has length 63 [2018-11-10 10:34:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:01,420 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 924 transitions. [2018-11-10 10:34:01,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:34:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 924 transitions. [2018-11-10 10:34:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 10:34:01,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:01,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:01,421 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:01,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:01,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1663625934, now seen corresponding path program 1 times [2018-11-10 10:34:01,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:01,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:01,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:01,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:34:01,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:34:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:34:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:01,582 INFO L87 Difference]: Start difference. First operand 728 states and 924 transitions. Second operand 13 states. [2018-11-10 10:34:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:01,793 INFO L93 Difference]: Finished difference Result 745 states and 942 transitions. [2018-11-10 10:34:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:34:01,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-10 10:34:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:01,795 INFO L225 Difference]: With dead ends: 745 [2018-11-10 10:34:01,795 INFO L226 Difference]: Without dead ends: 720 [2018-11-10 10:34:01,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-10 10:34:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-10 10:34:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-10 10:34:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 914 transitions. [2018-11-10 10:34:01,837 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 914 transitions. Word has length 62 [2018-11-10 10:34:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:01,838 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 914 transitions. [2018-11-10 10:34:01,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:34:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 914 transitions. [2018-11-10 10:34:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:34:01,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:01,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:01,839 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:01,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1192629544, now seen corresponding path program 1 times [2018-11-10 10:34:01,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:01,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:01,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:34:01,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:34:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:34:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:34:01,865 INFO L87 Difference]: Start difference. First operand 720 states and 914 transitions. Second operand 3 states. [2018-11-10 10:34:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:01,936 INFO L93 Difference]: Finished difference Result 842 states and 1072 transitions. [2018-11-10 10:34:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:34:01,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-10 10:34:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:01,939 INFO L225 Difference]: With dead ends: 842 [2018-11-10 10:34:01,939 INFO L226 Difference]: Without dead ends: 720 [2018-11-10 10:34:01,939 INFO L605 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 [2018-11-10 10:34:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-11-10 10:34:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2018-11-10 10:34:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-11-10 10:34:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 912 transitions. [2018-11-10 10:34:01,987 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 912 transitions. Word has length 66 [2018-11-10 10:34:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:01,987 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 912 transitions. [2018-11-10 10:34:01,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:34:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 912 transitions. [2018-11-10 10:34:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:34:01,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:01,988 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:01,988 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:01,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1875964411, now seen corresponding path program 1 times [2018-11-10 10:34:01,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:01,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:02,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:02,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:02,018 INFO L87 Difference]: Start difference. First operand 720 states and 912 transitions. Second operand 5 states. [2018-11-10 10:34:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:02,083 INFO L93 Difference]: Finished difference Result 766 states and 959 transitions. [2018-11-10 10:34:02,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:02,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-10 10:34:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:02,086 INFO L225 Difference]: With dead ends: 766 [2018-11-10 10:34:02,086 INFO L226 Difference]: Without dead ends: 714 [2018-11-10 10:34:02,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-10 10:34:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-11-10 10:34:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-11-10 10:34:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 902 transitions. [2018-11-10 10:34:02,113 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 902 transitions. Word has length 65 [2018-11-10 10:34:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:02,114 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 902 transitions. [2018-11-10 10:34:02,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 902 transitions. [2018-11-10 10:34:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 10:34:02,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:02,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:02,115 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:02,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1630066308, now seen corresponding path program 1 times [2018-11-10 10:34:02,115 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:02,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:34:02,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:34:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:34:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:34:02,210 INFO L87 Difference]: Start difference. First operand 714 states and 902 transitions. Second operand 12 states. [2018-11-10 10:34:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:02,314 INFO L93 Difference]: Finished difference Result 737 states and 926 transitions. [2018-11-10 10:34:02,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:34:02,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-10 10:34:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:02,317 INFO L225 Difference]: With dead ends: 737 [2018-11-10 10:34:02,317 INFO L226 Difference]: Without dead ends: 714 [2018-11-10 10:34:02,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-10 10:34:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-11-10 10:34:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-11-10 10:34:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 901 transitions. [2018-11-10 10:34:02,345 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 901 transitions. Word has length 70 [2018-11-10 10:34:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:02,345 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 901 transitions. [2018-11-10 10:34:02,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:34:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 901 transitions. [2018-11-10 10:34:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 10:34:02,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:02,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:02,347 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:02,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -928466434, now seen corresponding path program 1 times [2018-11-10 10:34:02,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:02,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:02,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:02,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:02,441 INFO L87 Difference]: Start difference. First operand 714 states and 901 transitions. Second operand 14 states. [2018-11-10 10:34:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:02,582 INFO L93 Difference]: Finished difference Result 740 states and 929 transitions. [2018-11-10 10:34:02,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:02,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-10 10:34:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:02,585 INFO L225 Difference]: With dead ends: 740 [2018-11-10 10:34:02,585 INFO L226 Difference]: Without dead ends: 712 [2018-11-10 10:34:02,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2018-11-10 10:34:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 710. [2018-11-10 10:34:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-11-10 10:34:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 895 transitions. [2018-11-10 10:34:02,612 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 895 transitions. Word has length 70 [2018-11-10 10:34:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:02,612 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 895 transitions. [2018-11-10 10:34:02,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 895 transitions. [2018-11-10 10:34:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:34:02,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:02,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:02,614 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:02,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash 158264959, now seen corresponding path program 1 times [2018-11-10 10:34:02,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:02,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:02,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 10:34:02,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:34:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:34:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:34:02,685 INFO L87 Difference]: Start difference. First operand 710 states and 895 transitions. Second operand 12 states. [2018-11-10 10:34:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:02,814 INFO L93 Difference]: Finished difference Result 732 states and 918 transitions. [2018-11-10 10:34:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:34:02,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-10 10:34:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:02,816 INFO L225 Difference]: With dead ends: 732 [2018-11-10 10:34:02,816 INFO L226 Difference]: Without dead ends: 708 [2018-11-10 10:34:02,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 10:34:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-11-10 10:34:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2018-11-10 10:34:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-11-10 10:34:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 891 transitions. [2018-11-10 10:34:02,863 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 891 transitions. Word has length 67 [2018-11-10 10:34:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:02,863 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 891 transitions. [2018-11-10 10:34:02,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:34:02,863 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 891 transitions. [2018-11-10 10:34:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:34:02,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:02,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:02,864 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:02,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1477541838, now seen corresponding path program 1 times [2018-11-10 10:34:02,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:02,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:02,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:02,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:02,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:02,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:02,911 INFO L87 Difference]: Start difference. First operand 708 states and 891 transitions. Second operand 5 states. [2018-11-10 10:34:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:02,966 INFO L93 Difference]: Finished difference Result 742 states and 926 transitions. [2018-11-10 10:34:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:02,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-10 10:34:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:02,969 INFO L225 Difference]: With dead ends: 742 [2018-11-10 10:34:02,969 INFO L226 Difference]: Without dead ends: 703 [2018-11-10 10:34:02,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-11-10 10:34:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2018-11-10 10:34:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-10 10:34:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 884 transitions. [2018-11-10 10:34:03,016 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 884 transitions. Word has length 67 [2018-11-10 10:34:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:03,016 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 884 transitions. [2018-11-10 10:34:03,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 884 transitions. [2018-11-10 10:34:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 10:34:03,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:03,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:03,018 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:03,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 800562057, now seen corresponding path program 1 times [2018-11-10 10:34:03,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:03,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:03,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:03,070 INFO L87 Difference]: Start difference. First operand 703 states and 884 transitions. Second operand 5 states. [2018-11-10 10:34:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:03,350 INFO L93 Difference]: Finished difference Result 787 states and 989 transitions. [2018-11-10 10:34:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:03,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-10 10:34:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:03,353 INFO L225 Difference]: With dead ends: 787 [2018-11-10 10:34:03,354 INFO L226 Difference]: Without dead ends: 778 [2018-11-10 10:34:03,354 INFO L605 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 [2018-11-10 10:34:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-10 10:34:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 703. [2018-11-10 10:34:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-11-10 10:34:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 882 transitions. [2018-11-10 10:34:03,384 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 882 transitions. Word has length 68 [2018-11-10 10:34:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:03,384 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 882 transitions. [2018-11-10 10:34:03,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 882 transitions. [2018-11-10 10:34:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:03,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:03,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:03,386 INFO L424 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:03,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1425039817, now seen corresponding path program 1 times [2018-11-10 10:34:03,386 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:03,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:03,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:03,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:03,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:03,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:03,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:03,413 INFO L87 Difference]: Start difference. First operand 703 states and 882 transitions. Second operand 5 states. [2018-11-10 10:34:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:03,455 INFO L93 Difference]: Finished difference Result 737 states and 917 transitions. [2018-11-10 10:34:03,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:03,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 10:34:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:03,457 INFO L225 Difference]: With dead ends: 737 [2018-11-10 10:34:03,457 INFO L226 Difference]: Without dead ends: 698 [2018-11-10 10:34:03,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-10 10:34:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2018-11-10 10:34:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-11-10 10:34:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 875 transitions. [2018-11-10 10:34:03,498 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 875 transitions. Word has length 69 [2018-11-10 10:34:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:03,498 INFO L481 AbstractCegarLoop]: Abstraction has 698 states and 875 transitions. [2018-11-10 10:34:03,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 875 transitions. [2018-11-10 10:34:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:03,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:03,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:03,500 INFO L424 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:03,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1329535212, now seen corresponding path program 1 times [2018-11-10 10:34:03,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:03,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:03,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:03,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:03,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:34:03,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:34:03,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:34:03,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:34:03,575 INFO L87 Difference]: Start difference. First operand 698 states and 875 transitions. Second operand 11 states. [2018-11-10 10:34:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:03,675 INFO L93 Difference]: Finished difference Result 725 states and 905 transitions. [2018-11-10 10:34:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:34:03,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 10:34:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:03,677 INFO L225 Difference]: With dead ends: 725 [2018-11-10 10:34:03,677 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 10:34:03,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 10:34:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2018-11-10 10:34:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-11-10 10:34:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 870 transitions. [2018-11-10 10:34:03,728 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 870 transitions. Word has length 69 [2018-11-10 10:34:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:03,728 INFO L481 AbstractCegarLoop]: Abstraction has 695 states and 870 transitions. [2018-11-10 10:34:03,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:34:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 870 transitions. [2018-11-10 10:34:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:03,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:03,729 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:03,729 INFO L424 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:03,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1592706261, now seen corresponding path program 1 times [2018-11-10 10:34:03,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:03,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:03,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:03,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:34:03,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:34:03,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:34:03,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:34:03,851 INFO L87 Difference]: Start difference. First operand 695 states and 870 transitions. Second operand 11 states. [2018-11-10 10:34:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:03,986 INFO L93 Difference]: Finished difference Result 705 states and 879 transitions. [2018-11-10 10:34:03,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:34:03,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-10 10:34:03,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:03,988 INFO L225 Difference]: With dead ends: 705 [2018-11-10 10:34:03,988 INFO L226 Difference]: Without dead ends: 699 [2018-11-10 10:34:03,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-10 10:34:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 692. [2018-11-10 10:34:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-11-10 10:34:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 863 transitions. [2018-11-10 10:34:04,016 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 863 transitions. Word has length 69 [2018-11-10 10:34:04,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,016 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 863 transitions. [2018-11-10 10:34:04,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:34:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 863 transitions. [2018-11-10 10:34:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:04,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:04,018 INFO L424 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1592983091, now seen corresponding path program 1 times [2018-11-10 10:34:04,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:04,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:04,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:04,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:04,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:04,057 INFO L87 Difference]: Start difference. First operand 692 states and 863 transitions. Second operand 5 states. [2018-11-10 10:34:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,277 INFO L93 Difference]: Finished difference Result 770 states and 962 transitions. [2018-11-10 10:34:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:04,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-10 10:34:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,279 INFO L225 Difference]: With dead ends: 770 [2018-11-10 10:34:04,279 INFO L226 Difference]: Without dead ends: 735 [2018-11-10 10:34:04,279 INFO L605 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 [2018-11-10 10:34:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-11-10 10:34:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 663. [2018-11-10 10:34:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-11-10 10:34:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 827 transitions. [2018-11-10 10:34:04,317 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 827 transitions. Word has length 69 [2018-11-10 10:34:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,317 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 827 transitions. [2018-11-10 10:34:04,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 827 transitions. [2018-11-10 10:34:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:34:04,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:04,318 INFO L424 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1499782956, now seen corresponding path program 1 times [2018-11-10 10:34:04,318 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:04,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:34:04,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:34:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:34:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:34:04,354 INFO L87 Difference]: Start difference. First operand 663 states and 827 transitions. Second operand 3 states. [2018-11-10 10:34:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,395 INFO L93 Difference]: Finished difference Result 689 states and 857 transitions. [2018-11-10 10:34:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:34:04,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-10 10:34:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,396 INFO L225 Difference]: With dead ends: 689 [2018-11-10 10:34:04,396 INFO L226 Difference]: Without dead ends: 649 [2018-11-10 10:34:04,397 INFO L605 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 [2018-11-10 10:34:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-10 10:34:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2018-11-10 10:34:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-10 10:34:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 802 transitions. [2018-11-10 10:34:04,422 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 802 transitions. Word has length 69 [2018-11-10 10:34:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,422 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 802 transitions. [2018-11-10 10:34:04,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:34:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 802 transitions. [2018-11-10 10:34:04,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 10:34:04,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:04,424 INFO L424 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1534088944, now seen corresponding path program 1 times [2018-11-10 10:34:04,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:04,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:04,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:04,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:04,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:04,483 INFO L87 Difference]: Start difference. First operand 645 states and 802 transitions. Second operand 7 states. [2018-11-10 10:34:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,542 INFO L93 Difference]: Finished difference Result 691 states and 849 transitions. [2018-11-10 10:34:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:04,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-10 10:34:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,544 INFO L225 Difference]: With dead ends: 691 [2018-11-10 10:34:04,544 INFO L226 Difference]: Without dead ends: 646 [2018-11-10 10:34:04,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:34:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-10 10:34:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2018-11-10 10:34:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-10 10:34:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 798 transitions. [2018-11-10 10:34:04,571 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 798 transitions. Word has length 74 [2018-11-10 10:34:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,571 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 798 transitions. [2018-11-10 10:34:04,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 798 transitions. [2018-11-10 10:34:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 10:34:04,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:04,572 INFO L424 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -832489070, now seen corresponding path program 1 times [2018-11-10 10:34:04,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:04,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:04,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:04,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:04,693 INFO L87 Difference]: Start difference. First operand 644 states and 798 transitions. Second operand 14 states. [2018-11-10 10:34:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,828 INFO L93 Difference]: Finished difference Result 666 states and 821 transitions. [2018-11-10 10:34:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:04,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-10 10:34:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,831 INFO L225 Difference]: With dead ends: 666 [2018-11-10 10:34:04,831 INFO L226 Difference]: Without dead ends: 634 [2018-11-10 10:34:04,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:04,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-10 10:34:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2018-11-10 10:34:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-10 10:34:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 783 transitions. [2018-11-10 10:34:04,874 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 783 transitions. Word has length 74 [2018-11-10 10:34:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:04,874 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 783 transitions. [2018-11-10 10:34:04,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 783 transitions. [2018-11-10 10:34:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 10:34:04,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:04,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:04,876 INFO L424 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:04,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1423434446, now seen corresponding path program 1 times [2018-11-10 10:34:04,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:04,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:04,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:04,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:04,928 INFO L87 Difference]: Start difference. First operand 634 states and 783 transitions. Second operand 5 states. [2018-11-10 10:34:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:04,976 INFO L93 Difference]: Finished difference Result 681 states and 832 transitions. [2018-11-10 10:34:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:04,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-10 10:34:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:04,978 INFO L225 Difference]: With dead ends: 681 [2018-11-10 10:34:04,978 INFO L226 Difference]: Without dead ends: 638 [2018-11-10 10:34:04,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-10 10:34:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 634. [2018-11-10 10:34:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-11-10 10:34:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 782 transitions. [2018-11-10 10:34:05,018 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 782 transitions. Word has length 71 [2018-11-10 10:34:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:05,018 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 782 transitions. [2018-11-10 10:34:05,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 782 transitions. [2018-11-10 10:34:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 10:34:05,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:05,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:05,019 INFO L424 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:05,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 627549552, now seen corresponding path program 1 times [2018-11-10 10:34:05,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:05,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:05,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:05,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:05,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:05,093 INFO L87 Difference]: Start difference. First operand 634 states and 782 transitions. Second operand 14 states. [2018-11-10 10:34:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:05,206 INFO L93 Difference]: Finished difference Result 658 states and 808 transitions. [2018-11-10 10:34:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:05,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 10:34:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:05,207 INFO L225 Difference]: With dead ends: 658 [2018-11-10 10:34:05,207 INFO L226 Difference]: Without dead ends: 627 [2018-11-10 10:34:05,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-11-10 10:34:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2018-11-10 10:34:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-10 10:34:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 772 transitions. [2018-11-10 10:34:05,231 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 772 transitions. Word has length 71 [2018-11-10 10:34:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:05,232 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 772 transitions. [2018-11-10 10:34:05,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 772 transitions. [2018-11-10 10:34:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 10:34:05,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:05,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:05,233 INFO L424 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:05,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:05,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1466862187, now seen corresponding path program 1 times [2018-11-10 10:34:05,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:05,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:05,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:05,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:05,299 INFO L87 Difference]: Start difference. First operand 627 states and 772 transitions. Second operand 14 states. [2018-11-10 10:34:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:05,415 INFO L93 Difference]: Finished difference Result 691 states and 840 transitions. [2018-11-10 10:34:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:05,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-10 10:34:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:05,416 INFO L225 Difference]: With dead ends: 691 [2018-11-10 10:34:05,416 INFO L226 Difference]: Without dead ends: 621 [2018-11-10 10:34:05,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-10 10:34:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-10 10:34:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 10:34:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 763 transitions. [2018-11-10 10:34:05,447 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 763 transitions. Word has length 71 [2018-11-10 10:34:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:05,447 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 763 transitions. [2018-11-10 10:34:05,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 763 transitions. [2018-11-10 10:34:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:34:05,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:05,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:05,448 INFO L424 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:05,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1892784974, now seen corresponding path program 1 times [2018-11-10 10:34:05,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:05,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:05,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:34:05,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:34:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:34:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:05,501 INFO L87 Difference]: Start difference. First operand 621 states and 763 transitions. Second operand 7 states. [2018-11-10 10:34:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:05,553 INFO L93 Difference]: Finished difference Result 675 states and 824 transitions. [2018-11-10 10:34:05,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:05,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-10 10:34:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:05,555 INFO L225 Difference]: With dead ends: 675 [2018-11-10 10:34:05,555 INFO L226 Difference]: Without dead ends: 619 [2018-11-10 10:34:05,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:34:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-10 10:34:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2018-11-10 10:34:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-11-10 10:34:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 753 transitions. [2018-11-10 10:34:05,580 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 753 transitions. Word has length 77 [2018-11-10 10:34:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:05,580 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 753 transitions. [2018-11-10 10:34:05,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:34:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 753 transitions. [2018-11-10 10:34:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 10:34:05,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:05,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:05,581 INFO L424 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:05,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1700582448, now seen corresponding path program 1 times [2018-11-10 10:34:05,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:05,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:05,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:05,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:05,676 INFO L87 Difference]: Start difference. First operand 615 states and 753 transitions. Second operand 14 states. [2018-11-10 10:34:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:05,784 INFO L93 Difference]: Finished difference Result 641 states and 781 transitions. [2018-11-10 10:34:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:05,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-11-10 10:34:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:05,786 INFO L225 Difference]: With dead ends: 641 [2018-11-10 10:34:05,786 INFO L226 Difference]: Without dead ends: 617 [2018-11-10 10:34:05,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-10 10:34:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2018-11-10 10:34:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-11-10 10:34:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 749 transitions. [2018-11-10 10:34:05,809 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 749 transitions. Word has length 77 [2018-11-10 10:34:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:05,810 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 749 transitions. [2018-11-10 10:34:05,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 749 transitions. [2018-11-10 10:34:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 10:34:05,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:05,810 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:05,810 INFO L424 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:05,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1328298255, now seen corresponding path program 1 times [2018-11-10 10:34:05,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:05,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 10:34:05,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 10:34:05,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 10:34:05,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:34:05,882 INFO L87 Difference]: Start difference. First operand 613 states and 749 transitions. Second operand 14 states. [2018-11-10 10:34:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:05,979 INFO L93 Difference]: Finished difference Result 672 states and 811 transitions. [2018-11-10 10:34:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 10:34:05,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-10 10:34:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:05,980 INFO L225 Difference]: With dead ends: 672 [2018-11-10 10:34:05,980 INFO L226 Difference]: Without dead ends: 601 [2018-11-10 10:34:05,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 10:34:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-10 10:34:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2018-11-10 10:34:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-11-10 10:34:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 730 transitions. [2018-11-10 10:34:06,004 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 730 transitions. Word has length 72 [2018-11-10 10:34:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:06,004 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 730 transitions. [2018-11-10 10:34:06,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 10:34:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 730 transitions. [2018-11-10 10:34:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 10:34:06,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:06,005 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:06,005 INFO L424 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:06,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1718873266, now seen corresponding path program 1 times [2018-11-10 10:34:06,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:34:06,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:34:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:34:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 10:34:06,063 INFO L87 Difference]: Start difference. First operand 601 states and 730 transitions. Second operand 11 states. [2018-11-10 10:34:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:06,139 INFO L93 Difference]: Finished difference Result 783 states and 941 transitions. [2018-11-10 10:34:06,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 10:34:06,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-10 10:34:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:06,141 INFO L225 Difference]: With dead ends: 783 [2018-11-10 10:34:06,141 INFO L226 Difference]: Without dead ends: 643 [2018-11-10 10:34:06,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-10 10:34:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 607. [2018-11-10 10:34:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-10 10:34:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 732 transitions. [2018-11-10 10:34:06,166 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 732 transitions. Word has length 71 [2018-11-10 10:34:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:06,166 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 732 transitions. [2018-11-10 10:34:06,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:34:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 732 transitions. [2018-11-10 10:34:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:34:06,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:06,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:06,168 INFO L424 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:06,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2090302376, now seen corresponding path program 1 times [2018-11-10 10:34:06,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:06,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:06,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:34:06,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:34:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:34:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:06,271 INFO L87 Difference]: Start difference. First operand 607 states and 732 transitions. Second operand 13 states. [2018-11-10 10:34:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:06,412 INFO L93 Difference]: Finished difference Result 627 states and 753 transitions. [2018-11-10 10:34:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:34:06,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-10 10:34:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:06,414 INFO L225 Difference]: With dead ends: 627 [2018-11-10 10:34:06,414 INFO L226 Difference]: Without dead ends: 602 [2018-11-10 10:34:06,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-10 10:34:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2018-11-10 10:34:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 10:34:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 724 transitions. [2018-11-10 10:34:06,444 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 724 transitions. Word has length 79 [2018-11-10 10:34:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:06,445 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 724 transitions. [2018-11-10 10:34:06,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:34:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 724 transitions. [2018-11-10 10:34:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 10:34:06,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:06,446 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:06,446 INFO L424 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:06,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:06,446 INFO L82 PathProgramCache]: Analyzing trace with hash -130625566, now seen corresponding path program 1 times [2018-11-10 10:34:06,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:06,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 10:34:06,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:34:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:34:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 10:34:06,542 INFO L87 Difference]: Start difference. First operand 602 states and 724 transitions. Second operand 13 states. [2018-11-10 10:34:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:06,669 INFO L93 Difference]: Finished difference Result 604 states and 725 transitions. [2018-11-10 10:34:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:34:06,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-10 10:34:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:06,671 INFO L225 Difference]: With dead ends: 604 [2018-11-10 10:34:06,671 INFO L226 Difference]: Without dead ends: 553 [2018-11-10 10:34:06,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:34:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-11-10 10:34:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-11-10 10:34:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-11-10 10:34:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 670 transitions. [2018-11-10 10:34:06,694 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 670 transitions. Word has length 72 [2018-11-10 10:34:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:06,694 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 670 transitions. [2018-11-10 10:34:06,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:34:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 670 transitions. [2018-11-10 10:34:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:34:06,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:06,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:06,695 INFO L424 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:06,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:06,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1138430218, now seen corresponding path program 1 times [2018-11-10 10:34:06,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:06,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:06,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:06,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:06,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:34:06,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 10:34:06,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:34:06,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:34:06,742 INFO L87 Difference]: Start difference. First operand 553 states and 670 transitions. Second operand 10 states. [2018-11-10 10:34:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:07,570 INFO L93 Difference]: Finished difference Result 1151 states and 1388 transitions. [2018-11-10 10:34:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 10:34:07,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-10 10:34:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:07,572 INFO L225 Difference]: With dead ends: 1151 [2018-11-10 10:34:07,572 INFO L226 Difference]: Without dead ends: 1004 [2018-11-10 10:34:07,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:34:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2018-11-10 10:34:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 869. [2018-11-10 10:34:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-10 10:34:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1069 transitions. [2018-11-10 10:34:07,609 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1069 transitions. Word has length 73 [2018-11-10 10:34:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:07,609 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1069 transitions. [2018-11-10 10:34:07,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 10:34:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1069 transitions. [2018-11-10 10:34:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:34:07,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:07,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:07,611 INFO L424 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:07,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1817702472, now seen corresponding path program 1 times [2018-11-10 10:34:07,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:07,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:07,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:07,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:07,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:07,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:34:07,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:34:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:34:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:34:07,657 INFO L87 Difference]: Start difference. First operand 869 states and 1069 transitions. Second operand 6 states. [2018-11-10 10:34:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:08,024 INFO L93 Difference]: Finished difference Result 1149 states and 1380 transitions. [2018-11-10 10:34:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:34:08,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-10 10:34:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:08,027 INFO L225 Difference]: With dead ends: 1149 [2018-11-10 10:34:08,027 INFO L226 Difference]: Without dead ends: 1019 [2018-11-10 10:34:08,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:34:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-11-10 10:34:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 958. [2018-11-10 10:34:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-10 10:34:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1173 transitions. [2018-11-10 10:34:08,099 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1173 transitions. Word has length 73 [2018-11-10 10:34:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:08,099 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1173 transitions. [2018-11-10 10:34:08,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:34:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1173 transitions. [2018-11-10 10:34:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:34:08,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:08,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:08,101 INFO L424 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:08,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1443465868, now seen corresponding path program 1 times [2018-11-10 10:34:08,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:08,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:34:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:34:08,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:34:08,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:34:08,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:34:08,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:34:08,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:08,159 INFO L87 Difference]: Start difference. First operand 958 states and 1173 transitions. Second operand 5 states. [2018-11-10 10:34:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:34:08,219 INFO L93 Difference]: Finished difference Result 1003 states and 1221 transitions. [2018-11-10 10:34:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:34:08,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-10 10:34:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:34:08,220 INFO L225 Difference]: With dead ends: 1003 [2018-11-10 10:34:08,221 INFO L226 Difference]: Without dead ends: 938 [2018-11-10 10:34:08,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:34:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-11-10 10:34:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2018-11-10 10:34:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2018-11-10 10:34:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1145 transitions. [2018-11-10 10:34:08,277 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1145 transitions. Word has length 73 [2018-11-10 10:34:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:34:08,278 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1145 transitions. [2018-11-10 10:34:08,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:34:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1145 transitions. [2018-11-10 10:34:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-10 10:34:08,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:34:08,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:34:08,279 INFO L424 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:34:08,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:34:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2027501370, now seen corresponding path program 1 times [2018-11-10 10:34:08,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:34:08,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:34:08,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:08,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:34:08,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:34:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:34:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:34:08,324 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:34:08,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:34:08 BoogieIcfgContainer [2018-11-10 10:34:08,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:34:08,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:34:08,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:34:08,384 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:34:08,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:33:48" (3/4) ... [2018-11-10 10:34:08,386 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:34:08,443 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36b67740-abce-4cb0-9c43-f9f645cba81c/bin-2019/uautomizer/witness.graphml [2018-11-10 10:34:08,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:34:08,443 INFO L168 Benchmark]: Toolchain (without parser) took 21922.58 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 765.5 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -388.3 MB). Peak memory consumption was 377.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:08,444 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:34:08,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 913.5 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:08,445 INFO L168 Benchmark]: Boogie Preprocessor took 121.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -228.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:08,445 INFO L168 Benchmark]: RCFGBuilder took 1052.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 143.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:08,445 INFO L168 Benchmark]: TraceAbstraction took 20305.81 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 608.7 MB). Free memory was 998.5 MB in the beginning and 1.3 GB in the end (delta: -346.3 MB). Peak memory consumption was 262.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:34:08,445 INFO L168 Benchmark]: Witness Printer took 59.15 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:34:08,446 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 913.5 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -228.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1052.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.5 MB in the end (delta: 143.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20305.81 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 608.7 MB). Free memory was 998.5 MB in the beginning and 1.3 GB in the end (delta: -346.3 MB). Peak memory consumption was 262.4 MB. Max. memory is 11.5 GB. * Witness Printer took 59.15 ms. Allocated memory is still 1.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int s ; [L32] int UNLOADED ; [L33] int NP ; [L34] int DC ; [L35] int SKIP1 ; [L36] int SKIP2 ; [L37] int MPR1 ; [L38] int MPR3 ; [L39] int IPC ; [L40] int pended ; [L41] int compFptr ; [L42] int compRegistered ; [L43] int lowerDriverReturn ; [L44] int setEventCalled ; [L45] int customIrp ; [L46] int routine ; [L47] int myStatus ; [L48] int pirp ; [L49] int Executive ; [L50] int Suspended ; [L51] int KernelMode ; [L52] int DeviceUsageTypePaging ; VAL [\old(compFptr)=276, \old(compRegistered)=265, \old(customIrp)=268, \old(DC)=261, \old(DeviceUsageTypePaging)=273, \old(Executive)=266, \old(IPC)=262, \old(KernelMode)=281, \old(lowerDriverReturn)=279, \old(MPR1)=275, \old(MPR3)=271, \old(myStatus)=278, \old(NP)=267, \old(pended)=280, \old(pirp)=272, \old(routine)=269, \old(s)=263, \old(setEventCalled)=274, \old(SKIP1)=270, \old(SKIP2)=264, \old(Suspended)=277, \old(UNLOADED)=260, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1717] int pirp__IoStatus__Status ; [L1718] int d = __VERIFIER_nondet_int() ; [L1719] int status = __VERIFIER_nondet_int() ; [L1720] int irp = __VERIFIER_nondet_int() ; [L1721] int we_should_unload = __VERIFIER_nondet_int() ; [L1722] int irp_choice = __VERIFIER_nondet_int() ; [L1723] int devobj = __VERIFIER_nondet_int() ; [L1724] int __cil_tmp9 ; [L1729] s = 0 [L1730] UNLOADED = 0 [L1731] NP = 0 [L1732] DC = 0 [L1733] SKIP1 = 0 [L1734] SKIP2 = 0 [L1735] MPR1 = 0 [L1736] MPR3 = 0 [L1737] IPC = 0 [L1738] pended = 0 [L1739] compFptr = 0 [L1740] compRegistered = 0 [L1741] lowerDriverReturn = 0 [L1742] setEventCalled = 0 [L1743] customIrp = 0 [L1744] routine = 0 [L1745] myStatus = 0 [L1746] pirp = 0 [L1747] Executive = 0 [L1748] Suspended = 5 [L1749] KernelMode = 0 [L1750] DeviceUsageTypePaging = 1 [L1753] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=0, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1754] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L66] UNLOADED = 0 [L67] NP = 1 [L68] DC = 2 [L69] SKIP1 = 3 [L70] SKIP2 = 4 [L71] MPR1 = 5 [L72] MPR3 = 6 [L73] IPC = 7 [L74] s = UNLOADED [L75] pended = 0 [L76] compFptr = 0 [L77] compRegistered = 0 [L78] lowerDriverReturn = 0 [L79] setEventCalled = 0 [L80] RET customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1754] _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1756] COND TRUE status >= 0 [L1757] s = NP [L1758] customIrp = 0 [L1759] setEventCalled = customIrp [L1760] lowerDriverReturn = setEventCalled [L1761] compRegistered = lowerDriverReturn [L1762] compFptr = compRegistered [L1763] pended = compFptr [L1764] pirp__IoStatus__Status = 0 [L1765] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1766] COND TRUE irp_choice == 0 [L1767] pirp__IoStatus__Status = -1073741637 [L1768] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1771] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1706] s = NP [L1707] customIrp = 0 [L1708] setEventCalled = customIrp [L1709] lowerDriverReturn = setEventCalled [L1710] compRegistered = lowerDriverReturn [L1711] compFptr = compRegistered [L1712] RET pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1771] stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1774] COND FALSE !(status < 0) [L1778] int tmp_ndt_1; [L1779] tmp_ndt_1 = __VERIFIER_nondet_int() [L1780] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L312] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L313] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L316] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L319] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L322] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L325] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1590] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1591] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1592] int irpSp__Control ; [L1593] int tmp ; [L1594] int tmp___0 ; [L1595] int __cil_tmp8 ; [L1596] int __cil_tmp9 ; [L1597] int __cil_tmp10 ; [L1598] int __cil_tmp11 ; [L1599] int __cil_tmp12 ; [L1603] __cil_tmp8 = 56 [L1604] __cil_tmp9 = 16384 [L1605] __cil_tmp10 = 131072 [L1606] __cil_tmp11 = 147456 [L1607] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1608] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1614] COND FALSE !(compRegistered != 0) [L1619] compRegistered = 1 [L1620] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1624] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1899] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1900] int returnVal2 ; [L1901] int compRetStatus ; [L1902] int lcontext = __VERIFIER_nondet_int() ; [L1903] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1906] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1568] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1569] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1572] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1573] COND TRUE pended == 0 [L1574] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1581] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1586] RET return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1919] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1920] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1927] COND FALSE !(\read(Irp__PendingReturned)) [L1930] int tmp_ndt_4; [L1931] tmp_ndt_4 = __VERIFIER_nondet_int() [L1932] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1943] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1957] COND TRUE s == NP [L1958] s = IPC [L1959] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1980] RET return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1625] EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1627] RET return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L347] EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L362] RET return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1797] EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] status = CdAudioDeviceControl(devobj, pirp) [L1818] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1824] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1832] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1840] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1856] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1868] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1870] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L58] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 537 locations, 1 error locations. UNSAFE Result, 20.2s OverallTime, 68 OverallIterations, 2 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39240 SDtfs, 16686 SDslu, 168696 SDs, 0 SdLazy, 14008 SolverSat, 2806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 151 SyntacticMatches, 6 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=958occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 67 MinimizatonAttempts, 1857 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 4046 NumberOfCodeBlocks, 4046 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3906 ConstructedInterpolants, 0 QuantifiedInterpolants, 507070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...